Suffix array for multi-pattern matching with variable length wildcards
Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact strin...
Saved in:
| Published in | Intelligent data analysis Vol. 25; no. 2; pp. 283 - 303 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
London, England
SAGE Publications
04.03.2021
Sage Publications Ltd |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1088-467X 1571-4128 |
| DOI | 10.3233/IDA-205087 |
Cover
| Abstract | Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact string matching in existing studies, as well as for approximate pattern matching and multi-pattern matching. An algorithm called MMSA-S is for the short exact characters in a pattern by dynamic programming, while another algorithm called MMSA-L deals with the long exact characters by the edit distance method. Experimental results of Pizza & Chili corpus demonstrate that these two newly proposed algorithms, in most cases, are more time-efficient than the state-of-the-art comparison algorithms. |
|---|---|
| AbstractList | Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact string matching in existing studies, as well as for approximate pattern matching and multi-pattern matching. An algorithm called MMSA-S is for the short exact characters in a pattern by dynamic programming, while another algorithm called MMSA-L deals with the long exact characters by the edit distance method. Experimental results of Pizza & Chili corpus demonstrate that these two newly proposed algorithms, in most cases, are more time-efficient than the state-of-the-art comparison algorithms. |
| Author | Liu, Na Xie, Fei Wu, Xindong |
| Author_xml | – sequence: 1 givenname: Na surname: Liu fullname: Liu, Na organization: , Yinchuan, Ningxia – sequence: 2 givenname: Fei surname: Xie fullname: Xie, Fei email: xiefei9815057@sina.com organization: , Hefei, Anhui – sequence: 3 givenname: Xindong surname: Wu fullname: Wu, Xindong organization: , Beijing |
| BookMark | eNptkE1LAzEQhoNUsK1e_AULHgRhNV_tZo-lWi0UPKjgbZl8tSnb3Zpkrf33RioI0tPMwPPOvPMOUK9pG4PQJcG3jDJ2N7-f5BSPsChOUJ-MCpJzQkUv9ViInI-L9zM0CGGNMeYU8z6avXTWuq8MvId9Zlufbbo6unwLMRrfZBuIauWaZbZzcZV9gncga5PVplmmeedqrcDrcI5OLdTBXPzWIXqbPbxOn_LF8-N8OlnkipYk5pxJwbmVQpXSAAMmsC4Lw8dCYs2tLSWjGoixUmJelooQWhZ4pMdWKy01ZUN0ddi79e1HZ0Ks1m3nm3SyokmQPuecJOrmQCnfhuCNrbbebcDvK4Krn5yqlFN1yCnB-B-sXITo2iZ6cPVxyfVBEmBp_hwcIb8BokF48w |
| CitedBy_id | crossref_primary_10_3233_IDA_216325 |
| Cites_doi | 10.1007/978-3-540-45234-8_94 10.1109/DASC.2009.65 10.1007/11809678_17 10.1016/0304-3975(92)90143-4 10.1007/s00453-017-0288-2 10.1093/bib/bbq015 10.1137/0206024 10.1007/3-540-61258-0_7 10.1016/j.eswa.2017.11.055 10.1016/j.ipl.2009.12.007 10.1007/3-540-09510-1_10 10.1007/s00453-018-0475-9 10.1145/360825.360855 10.1145/2897845.2897906 10.1093/bib/bbt081 10.1145/367390.367400 10.1515/9780773591400-014 10.1007/s00224-013-9498-4 10.1007/3-540-63307-3_57 10.1007/BF01206331 10.1145/509907.509992 10.4304/jsw.6.12.2391-2398 10.1145/375360.375365 10.1016/j.tcs.2012.03.029 10.1089/cmb.2015.0235 10.1016/j.tcs.2018.06.029 10.1080/01969722.2011.600651 10.1016/S0020-0190(99)00092-7 10.1016/j.tcs.2009.07.015 10.1007/s10044-018-0733-0 10.1016/j.tcs.2004.12.013 10.1109/DCC.2010.45 |
| ContentType | Journal Article |
| Copyright | 2021 – IOS Press. All rights reserved. Copyright IOS Press BV 2021 |
| Copyright_xml | – notice: 2021 – IOS Press. All rights reserved. – notice: Copyright IOS Press BV 2021 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.3233/IDA-205087 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1571-4128 |
| EndPage | 303 |
| ExternalDocumentID | 10_3233_IDA_205087 10.3233_IDA-205087 |
| GroupedDBID | --K 0R~ 1B1 29J 4.4 5GY 8VB AAEDT AAFNC AAFWJ AAGLT AALRI AAQXK AAXUO ABDBF ABIVO ABJNI ABUBZ ABUJY ABWVN ACGFS ACPQW ACRPL ACUHS ADEBD ADMLS ADMUD ADNMO ADZMO AEMOZ AENEX AEUPX AFPUW AFRHK AGIAB AGQPQ AHDMH AHQJS AJNRN AKVCP ALMA_UNASSIGNED_HOLDINGS ARTOV ASPBG AVWKF AZFZN CAG COF CS3 E.- EAD EAP EBA EBR EBS EBU EIS EJD EMK EPL EST ESX FDB FEDTE FGOYB FIRID HVGLF HZ~ I-F IHE IL9 IOS K1G M41 MET MIO MK~ ML~ MV1 NGNOM NQ- O9- OK1 P2P PQQKQ QWB R2- RIG ROL RPZ SEW TH9 TUS UHS ZL0 AAYXX CITATION H13 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c291t-43b844fb8c9bea3a380d97e468b0d4ff9b32da1efbb0499c1129705d6fdcdbd23 |
| ISSN | 1088-467X |
| IngestDate | Fri Jul 25 10:04:26 EDT 2025 Wed Oct 01 06:46:51 EDT 2025 Thu Apr 24 23:00:44 EDT 2025 Tue Jun 17 22:31:12 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | wildcards suffix array Pattern matching |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c291t-43b844fb8c9bea3a380d97e468b0d4ff9b32da1efbb0499c1129705d6fdcdbd23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2499050441 |
| PQPubID | 2046397 |
| PageCount | 21 |
| ParticipantIDs | proquest_journals_2499050441 crossref_primary_10_3233_IDA_205087 crossref_citationtrail_10_3233_IDA_205087 sage_journals_10_3233_IDA_205087 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2021-03-04 |
| PublicationDateYYYYMMDD | 2021-03-04 |
| PublicationDate_xml | – month: 03 year: 2021 text: 2021-03-04 day: 04 |
| PublicationDecade | 2020 |
| PublicationPlace | London, England |
| PublicationPlace_xml | – name: London, England – name: London |
| PublicationTitle | Intelligent data analysis |
| PublicationYear | 2021 |
| Publisher | SAGE Publications Sage Publications Ltd |
| Publisher_xml | – name: SAGE Publications – name: Sage Publications Ltd |
| References | Haapasalo, Silvasti, Sippu, Soisalon-Soininen Biswas, Ganguly, Shah, Thankachan 2018; 746 Ukkonen 2009; 410 Kulekci 2007 Li, Homer 2010; 11 Guo, Hong, Hu, Gao, Liu, Wu, Wu 2011; 42 Liu, Xie, Wu 2018; 21 Thankachan, Apostolico, Aluru 2016 Chattaraj, Parida 2005; 335 Ukkonen 1995; 14 Navarro 2001; 33 Weiner 1973 Manber, Myers 1993; 22 Fischer, Paterson Aho, Corasick 1975; 18 Hon, Lam, Shah, Thankachan, Ting, Yang 2018; 80 Bille, Gørtz 2014; 55 Knuth, Morris, Pratt 1977; 6 Clark, Schimmel 2003 Shrestha, Frith, Horton 2014; 15 Commentz-Walter 1979 Fredkin 1960; 3 Navarro, Baeza-Yates, Sutinen, Tarhio 2001; 24 Salmela, Tarhio, Kytöjoki 2007; 11 Muth, Manber 1996 Hon, Lam, Shah, Thankachan, Yang 2017; 80 Ukkonen 1992; 92 Arın, Erpam, Saygın 2018; 96 Baeza-Yates, Navarro 1997 Gog, Kärkkäinen, Kempa, Petri, Puglisi 2019; 81 Nong, Zhang, Chan 2011; 60 Akutsu 1996; 79 Zhang, Zhang, Tang, Bai 2011; 6 Bille, Gørtz, Vildhøj 2012; 443 Gog (10.3233/IDA-205087_ref2) 2019; 81 Ukkonen (10.3233/IDA-205087_ref44) 1992; 92 Clark (10.3233/IDA-205087_ref14) 2003 Guo (10.3233/IDA-205087_ref18) 2011; 42 Knuth (10.3233/IDA-205087_ref8) 1977; 6 Bille (10.3233/IDA-205087_ref22) 2012; 443 Bille (10.3233/IDA-205087_ref35) 2014; 55 Arın (10.3233/IDA-205087_ref45) 2018; 96 Hon (10.3233/IDA-205087_ref4) 2018; 80 10.3233/IDA-205087_ref25 10.3233/IDA-205087_ref24 10.3233/IDA-205087_ref23 Fischer (10.3233/IDA-205087_ref7) 10.3233/IDA-205087_ref5 Li (10.3233/IDA-205087_ref13) 2010; 11 10.3233/IDA-205087_ref20 Chattaraj (10.3233/IDA-205087_ref33) 2005; 335 Shrestha (10.3233/IDA-205087_ref37) 2014; 15 Salmela (10.3233/IDA-205087_ref43) 2007; 11 Aho (10.3233/IDA-205087_ref9) 1975; 18 Biswas (10.3233/IDA-205087_ref30) 2018; 746 Akutsu (10.3233/IDA-205087_ref6) 1996; 79 Ukkonen (10.3233/IDA-205087_ref34) 2009; 410 Haapasalo (10.3233/IDA-205087_ref21) Baeza-Yates (10.3233/IDA-205087_ref27) 1997 Zhang (10.3233/IDA-205087_ref29) 2011; 6 Commentz-Walter (10.3233/IDA-205087_ref10) 1979 10.3233/IDA-205087_ref36 Liu (10.3233/IDA-205087_ref41) 2018; 21 Nong (10.3233/IDA-205087_ref38) 2011; 60 10.3233/IDA-205087_ref12 10.3233/IDA-205087_ref11 Kulekci (10.3233/IDA-205087_ref28) 2007 Weiner (10.3233/IDA-205087_ref32) 1973 Hon (10.3233/IDA-205087_ref40) 2017; 80 Navarro (10.3233/IDA-205087_ref1) 2001; 33 Navarro (10.3233/IDA-205087_ref3) 2001; 24 Ukkonen (10.3233/IDA-205087_ref42) 1995; 14 Muth (10.3233/IDA-205087_ref26) 1996 Manber (10.3233/IDA-205087_ref15) 1993; 22 10.3233/IDA-205087_ref19 Fredkin (10.3233/IDA-205087_ref31) 1960; 3 Thankachan (10.3233/IDA-205087_ref39) 2016 10.3233/IDA-205087_ref17 10.3233/IDA-205087_ref16 |
| References_xml | – volume: 24 start-page: 19 issue: 4 year: 2001 end-page: 27 article-title: Indexing methods for approximate string matching publication-title: IEEE Data Eng. Bull. – volume: 410 start-page: 4341 issue: 43 year: 2009 end-page: 4349 article-title: Maximal and minimal representations of gapped and non-gapped motifs of a string publication-title: Theoretical Computer Science – volume: 80 start-page: 698 issue: 2 year: 2018 end-page: 713 article-title: Dictionary matching with a bounded gap in pattern or in text publication-title: Algorithmica – volume: 18 start-page: 333 issue: 6 year: 1975 end-page: 340 article-title: Efficient string matching: an aid to bibliographic search publication-title: Communications of the ACM – start-page: 118 year: 1979 end-page: 132 article-title: A string matching algorithm fast on the average publication-title: International Colloquium on Automata, Languages, and Programming – volume: 33 start-page: 31 issue: 1 year: 2001 end-page: 88 article-title: A guided tour to approximate string matching publication-title: ACM computing surveys (CSUR) – volume: 81 start-page: 1370 issue: 4 year: 2019 end-page: 1391 article-title: Fixed Block Compression Boosting in FM-Indexes: Theory and Practice publication-title: Algorithmica – volume: 443 start-page: 25 issue: 20 year: 2012 end-page: 34 article-title: String matching with variable length gaps publication-title: Theoretical Computer Science – volume: 14 start-page: 249 issue: 3 year: 1995 end-page: 260 article-title: On-line construction of suffix trees publication-title: Algorithmica – volume: 6 start-page: 2391 issue: 12 year: 2011 end-page: 2398 article-title: Multi-pattern Matching with Wildcards publication-title: JSW – volume: 11 start-page: 473 issue: 5 year: 2010 end-page: 483 article-title: A survey of sequence alignment algorithms for next-generation sequencing publication-title: Briefings in Bioinformatics – volume: 335 start-page: 3 issue: 1 year: 2005 end-page: 14 article-title: An inexact-suffix-tree-based algorithm for detecting extensible patterns publication-title: Theoretical Computer Science – volume: 55 start-page: 41 issue: 1 year: 2014 end-page: 60 article-title: String indexing for patterns with wildcards publication-title: Theory of Computing Systems – start-page: 1974 article-title: String-Matching and Other Products (No. MAC-TM-41) publication-title: Massachusetts Inst Of Tech Cambridge Project Mac – start-page: 956 year: 2003 end-page: 959 article-title: Efficient reconfigurable logic circuits for matching complex network intrusion detection patterns publication-title: International Conference on Field Programmable Logic and Applications. – start-page: 1 year: 2007 end-page: 6 article-title: Tara: An algorithm for fast searching of multiple patterns on text files publication-title: 2007 22nd international symposium on computer and information sciences – start-page: 1 year: 1973 end-page: 11 article-title: Linear pattern matching algorithm publication-title: 14th Annual IEEE Symposium on Switching and Automata Theory – volume: 3 start-page: 490 issue: 9 year: 1960 end-page: 499 article-title: Trie memory publication-title: Communications of the ACM – volume: 746 start-page: 98 year: 2018 end-page: 111 article-title: Ranked document retrieval for multiple patterns publication-title: Theoretical Computer Science – start-page: 472 year: 2016 end-page: 482 article-title: A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem publication-title: Journal of Computational Biology – volume: 21 start-page: 1151 issue: 4 year: 2018 end-page: 1165 article-title: Multi-pattern matching with variable-length wildcards using suffix tree publication-title: Pattern Analysis and Applications – volume: 80 start-page: 1 issue: 6 year: 2017 end-page: 16 article-title: Dictionary matching with a bounded gap in pattern or in text publication-title: Algorithmica – volume: 92 start-page: 191 issue: 1 year: 1992 end-page: 211 article-title: Approximate string-matching with q-grams and maximal matches publication-title: Theoretical computer science – volume: 96 start-page: 1 year: 2018 end-page: 13 article-title: I-TWEC: Interactive clustering tool for Twitter publication-title: Expert Systems with Applications – volume: 79 start-page: 1353 year: 1996 end-page: 1354 article-title: Approximate string matching with variable length don’t care characters publication-title: Ieice Transactions On Information And Systems E Series D – volume: 42 start-page: 382 issue: 6 year: 2011 end-page: 401 article-title: A bit-parallel algorithm for sequential pattern matching with wildcards publication-title: Cybernetics and Systems – volume: 15 start-page: 138 issue: 2 year: 2014 end-page: 154 article-title: A bioinformatician’s guide to the forefront of suffix array construction algorithms publication-title: Briefings in bioinformatics – start-page: 174 year: 1997 end-page: 184 article-title: Multiple approximate string matching publication-title: Workshop on Algorithms and Data Structures – start-page: 75 year: 1996 end-page: 86 article-title: Approximate multiple string search publication-title: Annual Symposium on Combinatorial Pattern Matching – start-page: 76 end-page: 87 article-title: Online dictionary matching with variable-length gaps publication-title: Proceedings of the 10th International Symposium, SEA Kolimpari – volume: 60 start-page: 1471 issue: 10 year: 2011 end-page: 1484 article-title: Two efficient algorithms for linear time suffix array construction publication-title: IEEE Transactions on Computers – volume: 11 start-page: 1 year: 2007 article-title: Multipattern string matching with q-grams publication-title: Journal of Experimental Algorithmics (JEA) – volume: 6 start-page: 323 issue: 2 year: 1977 end-page: 350 article-title: Fast pattern matching in strings publication-title: SIAM Journal on Computing – volume: 22 start-page: 935 issue: 5 year: 1993 end-page: 948 article-title: Suffix arrays: a new method for on-line string searches publication-title: Journal on Computing – start-page: 956 year: 2003 ident: 10.3233/IDA-205087_ref14 article-title: Efficient reconfigurable logic circuits for matching complex network intrusion detection patterns publication-title: International Conference on Field Programmable Logic and Applications. doi: 10.1007/978-3-540-45234-8_94 – volume: 22 start-page: 935 issue: 5 year: 1993 ident: 10.3233/IDA-205087_ref15 article-title: Suffix arrays: a new method for on-line string searches publication-title: Journal on Computing – ident: 10.3233/IDA-205087_ref16 doi: 10.1109/DASC.2009.65 – ident: 10.3233/IDA-205087_ref36 doi: 10.1007/11809678_17 – volume: 92 start-page: 191 issue: 1 year: 1992 ident: 10.3233/IDA-205087_ref44 article-title: Approximate string-matching with q-grams and maximal matches publication-title: Theoretical computer science doi: 10.1016/0304-3975(92)90143-4 – volume: 80 start-page: 698 issue: 2 year: 2018 ident: 10.3233/IDA-205087_ref4 article-title: Dictionary matching with a bounded gap in pattern or in text publication-title: Algorithmica doi: 10.1007/s00453-017-0288-2 – volume: 11 start-page: 473 issue: 5 year: 2010 ident: 10.3233/IDA-205087_ref13 article-title: A survey of sequence alignment algorithms for next-generation sequencing publication-title: Briefings in Bioinformatics doi: 10.1093/bib/bbq015 – volume: 6 start-page: 323 issue: 2 year: 1977 ident: 10.3233/IDA-205087_ref8 article-title: Fast pattern matching in strings publication-title: SIAM Journal on Computing doi: 10.1137/0206024 – ident: 10.3233/IDA-205087_ref11 – start-page: 75 year: 1996 ident: 10.3233/IDA-205087_ref26 article-title: Approximate multiple string search publication-title: Annual Symposium on Combinatorial Pattern Matching doi: 10.1007/3-540-61258-0_7 – start-page: 1 year: 2007 ident: 10.3233/IDA-205087_ref28 article-title: Tara: An algorithm for fast searching of multiple patterns on text files publication-title: 2007 22nd international symposium on computer and information sciences – volume: 24 start-page: 19 issue: 4 year: 2001 ident: 10.3233/IDA-205087_ref3 article-title: Indexing methods for approximate string matching publication-title: IEEE Data Eng. Bull. – volume: 96 start-page: 1 year: 2018 ident: 10.3233/IDA-205087_ref45 article-title: I-TWEC: Interactive clustering tool for Twitter publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2017.11.055 – ident: 10.3233/IDA-205087_ref17 doi: 10.1016/j.ipl.2009.12.007 – start-page: 76 ident: 10.3233/IDA-205087_ref21 article-title: Online dictionary matching with variable-length gaps publication-title: Proceedings of the 10th International Symposium, SEA Kolimpari – start-page: 118 year: 1979 ident: 10.3233/IDA-205087_ref10 article-title: A string matching algorithm fast on the average publication-title: International Colloquium on Automata, Languages, and Programming doi: 10.1007/3-540-09510-1_10 – volume: 80 start-page: 1 issue: 6 year: 2017 ident: 10.3233/IDA-205087_ref40 article-title: Dictionary matching with a bounded gap in pattern or in text publication-title: Algorithmica – volume: 81 start-page: 1370 issue: 4 year: 2019 ident: 10.3233/IDA-205087_ref2 article-title: Fixed Block Compression Boosting in FM-Indexes: Theory and Practice publication-title: Algorithmica doi: 10.1007/s00453-018-0475-9 – volume: 18 start-page: 333 issue: 6 year: 1975 ident: 10.3233/IDA-205087_ref9 article-title: Efficient string matching: an aid to bibliographic search publication-title: Communications of the ACM doi: 10.1145/360825.360855 – volume: 79 start-page: 1353 year: 1996 ident: 10.3233/IDA-205087_ref6 article-title: Approximate string matching with variable length don’t care characters publication-title: Ieice Transactions On Information And Systems E Series D – ident: 10.3233/IDA-205087_ref20 – ident: 10.3233/IDA-205087_ref25 doi: 10.1145/2897845.2897906 – ident: 10.3233/IDA-205087_ref5 doi: 10.1007/11809678_17 – volume: 11 start-page: 1 year: 2007 ident: 10.3233/IDA-205087_ref43 article-title: Multipattern string matching with q-grams publication-title: Journal of Experimental Algorithmics (JEA) – volume: 15 start-page: 138 issue: 2 year: 2014 ident: 10.3233/IDA-205087_ref37 article-title: A bioinformatician’s guide to the forefront of suffix array construction algorithms publication-title: Briefings in bioinformatics doi: 10.1093/bib/bbt081 – volume: 3 start-page: 490 issue: 9 year: 1960 ident: 10.3233/IDA-205087_ref31 article-title: Trie memory publication-title: Communications of the ACM doi: 10.1145/367390.367400 – ident: 10.3233/IDA-205087_ref23 doi: 10.1515/9780773591400-014 – volume: 55 start-page: 41 issue: 1 year: 2014 ident: 10.3233/IDA-205087_ref35 article-title: String indexing for patterns with wildcards publication-title: Theory of Computing Systems doi: 10.1007/s00224-013-9498-4 – start-page: 174 year: 1997 ident: 10.3233/IDA-205087_ref27 article-title: Multiple approximate string matching publication-title: Workshop on Algorithms and Data Structures doi: 10.1007/3-540-63307-3_57 – start-page: 1 year: 1973 ident: 10.3233/IDA-205087_ref32 article-title: Linear pattern matching algorithm publication-title: 14th Annual IEEE Symposium on Switching and Automata Theory – volume: 14 start-page: 249 issue: 3 year: 1995 ident: 10.3233/IDA-205087_ref42 article-title: On-line construction of suffix trees publication-title: Algorithmica doi: 10.1007/BF01206331 – ident: 10.3233/IDA-205087_ref19 doi: 10.1145/509907.509992 – volume: 6 start-page: 2391 issue: 12 year: 2011 ident: 10.3233/IDA-205087_ref29 article-title: Multi-pattern Matching with Wildcards publication-title: JSW doi: 10.4304/jsw.6.12.2391-2398 – volume: 33 start-page: 31 issue: 1 year: 2001 ident: 10.3233/IDA-205087_ref1 article-title: A guided tour to approximate string matching publication-title: ACM computing surveys (CSUR) doi: 10.1145/375360.375365 – start-page: 1974 ident: 10.3233/IDA-205087_ref7 article-title: String-Matching and Other Products (No. MAC-TM-41) publication-title: Massachusetts Inst Of Tech Cambridge Project Mac – volume: 443 start-page: 25 issue: 20 year: 2012 ident: 10.3233/IDA-205087_ref22 article-title: String matching with variable length gaps publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2012.03.029 – start-page: 472 year: 2016 ident: 10.3233/IDA-205087_ref39 article-title: A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem publication-title: Journal of Computational Biology doi: 10.1089/cmb.2015.0235 – volume: 746 start-page: 98 year: 2018 ident: 10.3233/IDA-205087_ref30 article-title: Ranked document retrieval for multiple patterns publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2018.06.029 – volume: 60 start-page: 1471-1484 issue: 10 year: 2011 ident: 10.3233/IDA-205087_ref38 article-title: Two efficient algorithms for linear time suffix array construction publication-title: IEEE Transactions on Computers – volume: 42 start-page: 382 issue: 6 year: 2011 ident: 10.3233/IDA-205087_ref18 article-title: A bit-parallel algorithm for sequential pattern matching with wildcards publication-title: Cybernetics and Systems doi: 10.1080/01969722.2011.600651 – ident: 10.3233/IDA-205087_ref24 doi: 10.1016/S0020-0190(99)00092-7 – volume: 410 start-page: 4341 issue: 43 year: 2009 ident: 10.3233/IDA-205087_ref34 article-title: Maximal and minimal representations of gapped and non-gapped motifs of a string publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2009.07.015 – volume: 21 start-page: 1151 issue: 4 year: 2018 ident: 10.3233/IDA-205087_ref41 article-title: Multi-pattern matching with variable-length wildcards using suffix tree publication-title: Pattern Analysis and Applications doi: 10.1007/s10044-018-0733-0 – volume: 335 start-page: 3 issue: 1 year: 2005 ident: 10.3233/IDA-205087_ref33 article-title: An inexact-suffix-tree-based algorithm for detecting extensible patterns publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2004.12.013 – ident: 10.3233/IDA-205087_ref12 doi: 10.1109/DCC.2010.45 |
| SSID | ssj0004204 |
| Score | 2.2602804 |
| Snippet | Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this... |
| SourceID | proquest crossref sage |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 283 |
| SubjectTerms | Algorithms Arrays Data structures Dynamic programming Pattern matching String matching |
| Title | Suffix array for multi-pattern matching with variable length wildcards |
| URI | https://journals.sagepub.com/doi/full/10.3233/IDA-205087 https://www.proquest.com/docview/2499050441 |
| Volume | 25 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1571-4128 dateEnd: 20241105 omitProxy: true ssIdentifier: ssj0004204 issn: 1088-467X databaseCode: ABDBF dateStart: 20000201 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1571-4128 dateEnd: 20241105 omitProxy: false ssIdentifier: ssj0004204 issn: 1088-467X databaseCode: ADMLS dateStart: 20000201 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9NAEF5BeoED9AFqoKCV4FJFBnt348cxoo1aRLm0lXyz9okiVWmVOqjqr2f24bWrRgJ6sZz12LJ2vsx-s54HQp9pqXJZKJOwKtXgoKhpInjGEk5gcSoYjEoXbfEzP7lk3-tp3TfjdNklrfgi7zfmlTxFqzAGerVZsv-h2fhQGIBz0C8cQcNw_Ccdn6-NWdxN-GrFfdylCw9MblzNzOUEyKiPlHSbrb_BK3Z5UrZ3CvwGkqykTbka8tPTWKGzndjg0QkPRUti4M5i7Y1yN1D7DxxzvYj23UnUC9sn5NdwV4H4sKrBrqL7nLVx4zADu5SAea39ChLMZgGeaBbSvINd9QnNAT9kaCR965qw3lJX4-CRKafEbjXPT49moHJgkUW_YMUwwiDW9ELP0RYB856O0Nbs6OzHeZ8iS1wnyfjyvlKtvftrf_dDbtI7HIMYP0c7LrbRq-Av4JlX_g56ppe76HXXiwMH07yLXp7F-ru3e2jukYEdMjAgAz9ABu6QgS0ycIcM7JGBIzLeoMv58cW3kyR0zEgkqbI2YVSUjBlRykpoTjktU1UVmuWlSBUzphKUKJ5pI4R1daUl20U6VblRUglF6Fs0Wl4v9T7CaS5NZYRJKQOiMxW8TFlRCAWUUWmTsTE67OaqkaGcvO1qctWAW9lppfHzOkafouyNL6KyUeqgm_Im_MluGwKvCVeBtI8RtmroLz1-wru_i7xHL3q4H6BRu1rrD0ArW_ExQOYPl3h1lA |
| linkProvider | EBSCOhost |
| 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=Suffix+array+for+multi-pattern+matching+with+variable+length+wildcards&rft.jtitle=Intelligent+data+analysis&rft.au=Liu%2C+Na&rft.au=Xie%2C+Fei&rft.au=Wu%2C+Xindong&rft.date=2021-03-04&rft.pub=SAGE+Publications&rft.issn=1088-467X&rft.eissn=1571-4128&rft.volume=25&rft.issue=2&rft.spage=283&rft.epage=303&rft_id=info:doi/10.3233%2FIDA-205087&rft.externalDocID=10.3233_IDA-205087 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1088-467X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1088-467X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1088-467X&client=summon |