Entropy-Based Approach in Selection Exact String-Matching Algorithms

The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Entropy (Basel, Switzerland) Ročník 23; číslo 1; s. 31
Hlavní autoři:	Markić, Ivan, Štula, Maja, Zorić, Marija, Stipaničev, Darko
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Switzerland MDPI AG 28.12.2020 MDPI
Témata:	algorithm efficiency algorithm performance Algorithms comparison Domains Efficiency Empirical analysis entropy Entropy (Information theory) exact string-matching Methodology Population Power consumption Scientific papers Search algorithms Software Software engineering String matching testing framework Texts testing framework comparison entropy algorithm efficiency exact string-matching algorithm performance
ISSN:	1099-4300, 1099-4300
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns’ entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.
AbstractList	The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns' entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology. The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns' entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns' entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.
Author	Zorić, Marija Stipaničev, Darko Markić, Ivan Štula, Maja
AuthorAffiliation	2 Department of Electronics and Computing, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 21000 Split, Croatia; maja.stula@fesb.hr (M.Š.); darko.stipanicev@fesb.hr (D.S.) 1 Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 21000 Split, Croatia 3 IT Department, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 21000 Split, Croatia; marijuki@fesb.hr
AuthorAffiliation_xml	– name: 3 IT Department, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 21000 Split, Croatia; marijuki@fesb.hr – name: 1 Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 21000 Split, Croatia – name: 2 Department of Electronics and Computing, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 21000 Split, Croatia; maja.stula@fesb.hr (M.Š.); darko.stipanicev@fesb.hr (D.S.)
Author_xml	– sequence: 1 givenname: Ivan orcidid: 0000-0003-3744-0731 surname: Markić fullname: Markić, Ivan – sequence: 2 givenname: Maja orcidid: 0000-0003-3954-7049 surname: Štula fullname: Štula, Maja – sequence: 3 givenname: Marija surname: Zorić fullname: Zorić, Marija – sequence: 4 givenname: Darko surname: Stipaničev fullname: Stipaničev, Darko
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/33379282$$D View this record in MEDLINE/PubMed
BookMark	eNplkk1v1DAQhi1URD_gwB9AkbjAIdRfceIL0lIWqFTEoXC2JvZk16tsHGwvov8et9tWbTl5ZD9-9GpmjsnBFCYk5DWjH4TQ9BS5oIxSwZ6RI0a1rqWg9OBBfUiOU9pQygVn6gU5FEK0mnf8iHxeTjmG-ar-BAldtZjnGMCuKz9VlziizT5M1fIv2Fxd5uinVf0dsl2XolqMqxB9Xm_TS_J8gDHhq9vzhPz6svx59q2--PH1_GxxUVupdK5baEBZblE53TROwaA6yRGFchwGquWAgEo67FlvBR-UBdWjakA2KDXvxQk533tdgI2Zo99CvDIBvLm5CHFlIGZvRzQaQdBO2dYxLW1f_KwdXCO7jjOBsimuj3vXvOu36CyWPsD4SPr4ZfJrswp_TNtxKYQqgne3ghh-7zBls_XJ4jjChGGXDJetlLqljBX07RN0E3ZxKq26oZoSiXaFevMw0X2Uu2EV4HQP2BhSijgY6zNcT6gE9KNh1Fyvg7lfh_Lj_ZMfd9L_2X_-K7Oo
CitedBy_id	crossref_primary_10_3390_electronics12122617 crossref_primary_10_3390_s22030992 crossref_primary_10_1155_2023_3278505
Cites_doi	10.1017/CBO9780511806087 10.1103/PhysRevE.79.046208 10.1109/TCBB.2016.2620143 10.1016/0960-0779(92)90058-U 10.1103/PhysRevE.50.5061 10.1145/2431211.2431212 10.1016/0890-5401(91)90016-U 10.1002/j.1538-7305.1948.tb01338.x 10.1002/spe.4380211105 10.1016/0950-7051(95)98902-I 10.1371/journal.pone.0200912 10.1002/047174882X 10.1016/j.csi.2015.12.005 10.4103/0976-500X.77120 10.1080/00207160108805036 10.1007/11558569_8 10.3390/e13030595 10.2307/2685263 10.1006/jtbi.1997.0493 10.1007/978-3-319-38827-4_12 10.1145/79173.79184 10.18178/ijmlc.2016.6.3.593 10.1137/0206024 10.1109/ACCESS.2019.2914071 10.1145/359842.359859 10.2507/23rd.daaam.proceedings.133 10.1017/CBO9781316135228 10.1002/9781118422007 10.1002/spe.4380100608 10.1007/11753728_29
ContentType	Journal Article
Copyright	2021. This work is licensed under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. 2020 by the authors. 2020
Copyright_xml	– notice: 2021. This work is licensed under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: 2020 by the authors. 2020
DBID	AAYXX CITATION NPM 7TB 8FD 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO FR3 HCIFZ KR7 L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS 7X8 5PM DOA
DOI	10.3390/e23010031
DatabaseName	CrossRef PubMed Mechanical & Transportation Engineering Abstracts Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest MSED ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea Engineering Research Database SciTech Premium Collection Civil Engineering Abstracts ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef PubMed Publicly Available Content Database Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central Essentials ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Civil Engineering Abstracts Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) MEDLINE - Academic
DatabaseTitleList	PubMed CrossRef MEDLINE - Academic Publicly Available Content Database
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
EISSN	1099-4300
ExternalDocumentID	oai_doaj_org_article_9ea3086c7d194cb2af17fd5488213e45 PMC7824336 33379282 10_3390_e23010031
Genre	Journal Article
GroupedDBID	29G 2WC 5GY 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ACIWK ACUHS ADBBV AEGXH AENEX AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS BCNDV BENPR BGLVJ CCPQU CITATION CS3 DU5 E3Z ESX F5P GROUPED_DOAJ GX1 HCIFZ HH5 IAO J9A KQ8 L6V M7S MODMG M~E OK1 OVT PGMZT PHGZM PHGZT PIMPY PQGLB PROAC PTHSS RNS RPM TR2 TUS XSB ~8M NPM 7TB 8FD ABUWG AZQEC DWQXO FR3 KR7 PKEHL PQEST PQQKQ PQUKI PRINS 7X8 PUEGO 5PM
ID	FETCH-LOGICAL-c469t-7a5a6c2ce6d955d6af6842ee36d2af094feae64deb1bc32f6ca6be65a45e492b3
IEDL.DBID	M7S
ISICitedReferencesCount	5
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000610149400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1099-4300
IngestDate	Fri Oct 03 12:53:47 EDT 2025 Tue Nov 04 01:57:44 EST 2025 Thu Sep 04 19:16:29 EDT 2025 Fri Jul 25 12:05:25 EDT 2025 Thu Jan 02 22:41:38 EST 2025 Sat Nov 29 07:09:29 EST 2025 Tue Nov 18 22:37:05 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	testing framework comparison entropy algorithm efficiency exact string-matching algorithm performance
Language	English
License	Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c469t-7a5a6c2ce6d955d6af6842ee36d2af094feae64deb1bc32f6ca6be65a45e492b3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ORCID	0000-0003-3744-0731 0000-0003-3954-7049
OpenAccessLink	https://www.proquest.com/docview/2474521308?pq-origsite=%requestingapplication%
PMID	33379282
PQID	2474521308
PQPubID	2032401
ParticipantIDs	doaj_primary_oai_doaj_org_article_9ea3086c7d194cb2af17fd5488213e45 pubmedcentral_primary_oai_pubmedcentral_nih_gov_7824336 proquest_miscellaneous_2474497011 proquest_journals_2474521308 pubmed_primary_33379282 crossref_citationtrail_10_3390_e23010031 crossref_primary_10_3390_e23010031
PublicationCentury	2000
PublicationDate	20201228
PublicationDateYYYYMMDD	2020-12-28
PublicationDate_xml	– month: 12 year: 2020 text: 20201228 day: 28
PublicationDecade	2020
PublicationPlace	Switzerland
PublicationPlace_xml	– name: Switzerland – name: Basel
PublicationTitle	Entropy (Basel, Switzerland)
PublicationTitleAlternate	Entropy (Basel)
PublicationYear	2020
Publisher	MDPI AG MDPI
Publisher_xml	– name: MDPI AG – name: MDPI
References	ref_50 Lesne (ref_25) 2009; 79 Faro (ref_38) 2013; 45 Boyer (ref_51) 1977; 20 Barabucci (ref_32) 2016; 46 ref_58 ref_13 ref_57 ref_56 ref_10 Singla (ref_15) 2012; 1 Gusfield (ref_12) 1997; 28 Manikandan (ref_17) 2011; 2 ref_16 ref_59 Horspool (ref_55) 1980; 10 ref_61 ref_60 SaiKrishna (ref_5) 2012; 9 Jiji (ref_14) 2017; 10 ref_21 Alhendawi (ref_42) 2013; 2 ref_20 Knuth (ref_52) 1977; 6 ref_63 Jain (ref_36) 2012; 3 Ebeling (ref_23) 1992; 2 ref_29 ref_28 Pandiselvam (ref_37) 2014; 2014 Hakak (ref_11) 2019; 7 Alshagarin (ref_4) 2014; 4 ref_35 ref_34 Sunday (ref_54) 1990; 33 ref_31 Apostolico (ref_53) 1991; 95 Pizzi (ref_2) 2018; 15 Shannon (ref_27) 1948; 27 Rhodes (ref_26) 1995; 8 Teixeira (ref_30) 2011; 13 Taherdoost (ref_19) 2017; 2 ref_39 Michailidis (ref_7) 2001; 76 Rodgers (ref_62) 1988; 42 Schmitt (ref_22) 1997; 188 Hume (ref_9) 1991; 21 Ivkovic (ref_33) 2016; 6 ref_47 Faro (ref_8) 2016; Volume 9702 ref_46 ref_44 ref_43 ref_41 ref_40 ref_1 ref_3 Bartlett (ref_18) 2001; 19 (ref_45) 2018; 10 Herzel (ref_24) 1994; 50 ref_49 ref_48 ref_6
References_xml	– ident: ref_1 doi: 10.1017/CBO9780511806087 – volume: 79 start-page: 1 year: 2009 ident: ref_25 article-title: Entropy estimation of very short symbolic sequences publication-title: Phys. Rev. E doi: 10.1103/PhysRevE.79.046208 – ident: ref_49 – volume: 15 start-page: 117 year: 2018 ident: ref_2 article-title: Efficient algorithms for sequence analysis with entropic profiles publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2016.2620143 – volume: 2 start-page: 237 year: 2017 ident: ref_19 article-title: Determining Sample Size; How to Calculate Survey Sample Size publication-title: Int. J. Econ. Manag. Syst. – volume: 2 start-page: 635 year: 1992 ident: ref_23 article-title: Word frequency and entropy of symbolic sequences: A dynamical perspective publication-title: Chaos Solitons Fractals doi: 10.1016/0960-0779(92)90058-U – volume: 50 start-page: 5061 year: 1994 ident: ref_24 article-title: Entropies of biosequences: The role of repeats publication-title: Phys. Rev. E doi: 10.1103/PhysRevE.50.5061 – volume: 45 start-page: 13 year: 2013 ident: ref_38 article-title: The Exact Online String Matching Problem: A Review of the Most Recent Results publication-title: Acm Comput. Surv. doi: 10.1145/2431211.2431212 – ident: ref_39 – ident: ref_61 – ident: ref_35 – volume: 1 start-page: 2231 year: 2012 ident: ref_15 article-title: String Matching Algorithms and their Applicability in various Applications publication-title: Int. J. Soft Comput. Eng. – volume: 95 start-page: 76 year: 1991 ident: ref_53 article-title: Optimal canonization of all substrings of a string publication-title: Inf. Comput. doi: 10.1016/0890-5401(91)90016-U – ident: ref_58 – volume: 27 start-page: 379 year: 1948 ident: ref_27 article-title: A Mathematical Theory of Communication publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1948.tb01338.x – volume: 21 start-page: 1221 year: 1991 ident: ref_9 article-title: Fast string searching publication-title: Softw. Pract. Exp. doi: 10.1002/spe.4380211105 – ident: ref_48 – volume: 8 start-page: 249 year: 1995 ident: ref_26 article-title: Use of maximum entropy method as a methodology for probabilistic reasoning publication-title: Knowl. Based Syst. doi: 10.1016/0950-7051(95)98902-I – ident: ref_56 doi: 10.1371/journal.pone.0200912 – ident: ref_40 doi: 10.1002/047174882X – ident: ref_13 – volume: 46 start-page: 52 year: 2016 ident: ref_32 article-title: Measuring the quality of diff algorithms: A formalization publication-title: Comput. Stand. Interfaces doi: 10.1016/j.csi.2015.12.005 – volume: 2014 start-page: 1 year: 2014 ident: ref_37 article-title: A comparative study on string matching algorithms of biological sequences publication-title: Int. Conf. Intell. Comput. – volume: 19 start-page: 43 year: 2001 ident: ref_18 article-title: Organizational research: Determining appropriate sample size in survey research publication-title: Inf. Technol. Learn. Perform. J. – volume: 4 start-page: 144 year: 2014 ident: ref_4 article-title: A Survey of String Matching Algorithms publication-title: J. Eng. Res. Appl. – ident: ref_20 – ident: ref_59 – volume: 10 start-page: 36 year: 2018 ident: ref_45 article-title: Pattern Searching in Genome publication-title: Int. J. Adv. Comput. Technol. – volume: 2 start-page: 54 year: 2011 ident: ref_17 article-title: Frequency distribution publication-title: J. Pharmacol. Pharmacother. doi: 10.4103/0976-500X.77120 – volume: 76 start-page: 411 year: 2001 ident: ref_7 article-title: On-line string matching algorithms: Survey and experimental results publication-title: Int. J. Comput. Math. doi: 10.1080/00207160108805036 – ident: ref_31 doi: 10.1007/11558569_8 – volume: 13 start-page: 595 year: 2011 ident: ref_30 article-title: Entropy Measures vs. Kolmogorov Complexity publication-title: Entropy doi: 10.3390/e13030595 – volume: 28 start-page: 554 year: 1997 ident: ref_12 article-title: Algorithms on strings, trees, and sequences: Computer science and computational biology publication-title: Theory Pract. – volume: 42 start-page: 59 year: 1988 ident: ref_62 article-title: Thirteen Ways to Look at the Correlation Coefficient publication-title: Am. Stat. doi: 10.2307/2685263 – volume: 188 start-page: 369 year: 1997 ident: ref_22 article-title: Estimating the entropy of DNA sequences publication-title: J. Theor. Biol. doi: 10.1006/jtbi.1997.0493 – ident: ref_3 – volume: Volume 9702 start-page: 145 year: 2016 ident: ref_8 article-title: Evaluation and improvement of fast algorithms for exact matching on genome sequences publication-title: International Conference on Algorithms for Computational Biology doi: 10.1007/978-3-319-38827-4_12 – ident: ref_34 – ident: ref_47 – volume: 33 start-page: 132 year: 1990 ident: ref_54 article-title: A very fast substring search algorithm publication-title: Commun. ACM doi: 10.1145/79173.79184 – volume: 6 start-page: 167 year: 2016 ident: ref_33 article-title: Measuring Performance of Optimization Algorithms in Evolutionary Computation publication-title: Int. J. Mach. Learn. Comput. doi: 10.18178/ijmlc.2016.6.3.593 – ident: ref_63 – ident: ref_44 – volume: 6 start-page: 323 year: 1977 ident: ref_52 article-title: Fast Pattern Matching in Strings publication-title: SIAM J. Comput. doi: 10.1137/0206024 – ident: ref_21 – volume: 7 start-page: 69614 year: 2019 ident: ref_11 article-title: Exact String Matching Algorithms: Survey, Issues, and Future Research Directions publication-title: IEEE Access doi: 10.1109/ACCESS.2019.2914071 – volume: 20 start-page: 762 year: 1977 ident: ref_51 article-title: A fast string searching algorithm publication-title: Commun. ACM doi: 10.1145/359842.359859 – volume: 10 start-page: 2707 year: 2017 ident: ref_14 article-title: Survey of Exact String Matching Algorithm for Detecting Patterns in Protein Sequence publication-title: Adv. Comput. Sci. Technol. – ident: ref_41 doi: 10.2507/23rd.daaam.proceedings.133 – ident: ref_6 – ident: ref_50 – ident: ref_29 – ident: ref_10 doi: 10.1017/CBO9781316135228 – ident: ref_46 – volume: 9 start-page: 219 year: 2012 ident: ref_5 article-title: String Matching and its Application in Diversified Fields publication-title: IJCSI Int. J. Comput. Sci. Issues – ident: ref_16 doi: 10.1002/9781118422007 – volume: 10 start-page: 501 year: 1980 ident: ref_55 article-title: Practical fast searching in strings publication-title: Softw. Pract. Exp. doi: 10.1002/spe.4380100608 – ident: ref_28 doi: 10.1007/11753728_29 – volume: 2 start-page: 2637 year: 2013 ident: ref_42 article-title: String Matching Algoritms (SMAs): Survey & Empirical Analysis publication-title: J. Comput. Sci. Manag. – ident: ref_43 – ident: ref_60 – ident: ref_57 – volume: 3 start-page: 537 year: 2012 ident: ref_36 article-title: Comparative Study on Text Pattern Matching for Heterogeneous System publication-title: Int. J. Comput. Sci. Eng. Technol.
SSID	ssj0023216
Score	2.2517915
Snippet	The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms...
SourceID	doaj pubmedcentral proquest pubmed crossref
SourceType	Open Website Open Access Repository Aggregation Database Index Database Enrichment Source
StartPage	31
SubjectTerms	algorithm efficiency algorithm performance Algorithms comparison Domains Efficiency Empirical analysis entropy Entropy (Information theory) exact string-matching Methodology Population Power consumption Scientific papers Search algorithms Software Software engineering String matching testing framework Texts
SummonAdditionalLinks	– databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT9wwEB0h1AOXqlWhTaEoVD30YrHJOHZ8XOgiLkWVoBK3yLHHZSWaRbsB0X_fcZKN2AqJS6-JEzlv_PGe7bwB-MI9RilDUmQ6aCFDgcJSGYTLtMcQiMpJ6JJN6IuL8vra_HiS6iueCevtgXvgjg1ZZNrttGe57ercBn6rZ55d5hmS7NxLJ9qsxdQgtTDPVO8jhCzqj4mJdhbb78bs05n0P8cs_z0g-WTGOXsDrweqmE77Kr6FLWrewbdZPFp-90ec8PTj0-lgCZ7Om_SyS2nDOKezR-va9LKNa3biOw-2cZkpnd7-Wizn7c3v1S78PJtdnZ6LIROCcCxfW6FtYZXLHSlvisIrG-L2GREqz4CwQgtkSUnPA2_tMA_KWVWTKqwsSJq8xj3YbhYNfYAUJ4xnZrRViFIab0sWMJFnW1YOtrYJfF0jVLnBJjxmq7itWC5EMKsRzAQ-j0Xvem-M5wqdRJjHAtHOurvAQa6GIFcvBTmBg3WQqqGPrapcasnkgx9M4Gi8zb0jbnnYhhb3fRlpNA9iCbzvYzrWBBG1YcWZgN6I9kZVN-8085vOgZtplURUH__Ht-3DTh41fBZ_kz-A7XZ5T5_glXto56vlYdes_wJ-d_4F priority: 102 providerName: Directory of Open Access Journals
Title	Entropy-Based Approach in Selection Exact String-Matching Algorithms
URI	https://www.ncbi.nlm.nih.gov/pubmed/33379282 https://www.proquest.com/docview/2474521308 https://www.proquest.com/docview/2474497011 https://pubmed.ncbi.nlm.nih.gov/PMC7824336 https://doaj.org/article/9ea3086c7d194cb2af17fd5488213e45
Volume	23
WOSCitedRecordID	wos000610149400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: DOA dateStart: 20160101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: M~E dateStart: 19990101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: M7S dateStart: 19990301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: BENPR dateStart: 19990301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: PIMPY dateStart: 19990301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9NAEB7RlgOXAuJlKJFBHLisGnvXu94TSqgrODSKCEjhZK330UYqTpq4CC78dmbtjUtQxYWLD96RPPY8dr7Z8QzAG7QYzqVlJBFOEOYySpTNHdGJMNQ5a_Oha4dNiMkkn8_lNCTcNqGscusTW0dtltrnyI9TJhhuNXSYv1tdET81yp-uhhEae3DguyQkbenerAdcNE14102IIrQ_thhuJ16Ld_agtlX_bfHl32WSf-w7p_f_l-MHcBgiznjUqchDuGPrR3BS-Ar11U8yxl3MxKPQWTxe1PGsnYyD4oqLH0o38azxqT9yhj7bZ6vi0eU5PqW5-LZ5DF9Oi8_vP5AwUIFoRMENESpTXKfaciOzzHDl_CmctZSbVDkEes4qy5lB_11pmjquFa8szxTLLJNpRZ_Afr2s7TOI6VDhx5RCcUoZk0bliIN8uK4QgKhKRfB2-4lLHbqN-6EXlyWiDi-NspdGBK970lXXYuM2orGXU0_gu2K3N5br8zIYWSktMpVzLUwima7wnVADDWKyHMVgWRbB0VZSZTDVTXkjpghe9ctoZP7kRNV2ed3RMCnQF0bwtFOKnhNKqZAIXCMQO-qyw-ruSr24aBt5Y3TGKOXP_83WC7iXepCf-P_oj2C_WV_bl3BXf28Wm_UA9sQ8H8DBuJhMPw3alMKgtQJ__VXgyvTj2fTrb_AdEqs
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQXHuIVKBAQSFysbmzHjg8IbelWrdqukLZIvQXHj3alkl12U6B_it_IOC9YVHHrgWtsRePM8xtPZgBeo8YIoRwnifSScJ8yol3miUmkZd47lw18PWxCjsfZ8bH6uAY_u39hQlllZxNrQ21nJuTINymXHF0NG2Tv519JmBoVble7ERqNWOy7i-8I2Zbv9raRv28o3Rkdfdgl7VQBYhAKVkTqVAtDjRNWpakV2oerKOeYsFR7RDveaSe4RSNWGEa9MFoUTqSap44rWjB87zW4jmEEVXWp4KQHeIwmoulexJgabDoM75OgNSs-rx4NcFk8-3dZ5h9-bufO__aF7sLtNqKOh40K3IM1V96H7VGowJ9fkC300jYetp3T42kZT-rJPyiO8eiHNlU8qUJqkxyiTwrZuHh4doKnqk6_LB_Apysh_CGsl7PSPYaYDTQyT0ktGONcWZ0hzgtwRCPA0oWO4G3H0ty03dTDUI-zHFFV4H7ecz-CV_3WedNC5LJNW0Eu-g2h63f9YLY4yVsjkiuHRGXCSJsobgo8E2qYRcyZIdsdTyPY6CQjb03RMv8tFhG87JfRiISbIV262XmzhyuJtj6CR40Q9pQwxqRCYB6BXBHPFVJXV8rpad2oHKNPzph48m-yXsDN3aPDg_xgb7z_FG7RkNBIQs-ADVivFufuGdww36rpcvG81rYYPl-18P4C8X5tBQ
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bb9MwFD4aHUK8cBG3wICAQOIlamM7dvyAUEdbUY1VlQbSeAqOL1ulLe3aDNhf49dxnKSBoom3PfAaW9Fx_J3LZ5-cA_AKNYZzaVkUCyci5hIaKZu6SMfCUOesTXuuajYhJpP08FBOt-Dn-l8Yn1a5tomVoTZz7c_Iu4QJhq6G9tKua9IipoPRu8VZ5DtI-ZvWdTuNGiJ79uI70rfV2_EA9_o1IaPhp_cfoqbDQKSRFpaRUInimmjLjUwSw5Xz11LWUm6Icsh8nFWWM4MGLdeUOK4Vzy1PFEsskySn-N5rsI0hOSMd2J6O96dfWrpHSczrWkaUyl7XYrAfex3a8IBVo4DLotu_kzT_8Hqj2__z97oDt5pYO-zXynEXtmxxDwZDn5u_uIh20X-bsN_UVA9nRXhQ9QRCoIbDH0qX4UHpDz2jffRW_pwu7J8c4arK49PVffh8JYI_gE4xL-wjCGlP4UZKoTiljEmjUmSAnqgopF4qVwG8WW9vpps6677dx0mGfMsjIWuREMDLduqiLi5y2aRdj5F2gq8HXj2YL4-yxrxk0qJQKdfCxJLpHNeEumeQjaYIAcuSAHbWKMkaI7XKfkMkgBftMJoXf2ekCjs_r-cwKdALBPCwBmQrCaVUSKTsAYgNqG6IujlSzI6rEuYYlzJK-eN_i_UcbiBms4_jyd4TuEn8SUfsiwnsQKdcntuncF1_K2er5bNG9UL4etXo_QWen3c7
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Entropy-Based+Approach+in+Selection+Exact+String-Matching+Algorithms&rft.jtitle=Entropy+%28Basel%2C+Switzerland%29&rft.au=Marki%C4%87%2C+Ivan&rft.au=%C5%A0tula%2C+Maja&rft.au=Zori%C4%87%2C+Marija&rft.au=Stipani%C4%8Dev%2C+Darko&rft.date=2020-12-28&rft.pub=MDPI&rft.eissn=1099-4300&rft.volume=23&rft.issue=1&rft_id=info:doi/10.3390%2Fe23010031&rft_id=info%3Apmid%2F33379282&rft.externalDocID=PMC7824336
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1099-4300&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1099-4300&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1099-4300&client=summon