Efficient string matching with wildcards and length constraintsGONG CHEN; XINDONG WU; XINGQUAN ZHU et al.Knowledge and information systems. 2006, Vol 10, Num 4, pp 399-419, 21 p.Article

Fast partial evaluation of pattern matching in stringsMADS SIG AGER; DANVY, Olivier; ROHDE, Henning Korsholm et al.ACM SIGPLAN notices. 2003, Vol 38, Num 10, pp 243-249, issn 1523-2867, 7 p.Conference Paper

On the comparison complexity of the string prefix-matching problemBRESLAUER, D; COLUSSI, L; TONIOLO, L et al.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 18-67, issn 0196-6774Article

The Exact Online String Matching Problem: A Review of the Most Recent ResultsFARO, Simone; LECROQ, Thierry.ACM computing surveys. 2013, Vol 45, Num 2, issn 0360-0300, 13.1-13.42Article

One-gapped q-gram filters for Levenshtein distanceBURKHARDT, Stefan; KÄRKKÄINEN, Juha.Lecture notes in computer science. 2002, pp 225-234, issn 0302-9743, isbn 3-540-43862-9, 10 p.Conference Paper

Incremental string comparisonLANDAU, G. M; MYERS, E. W; SCHMIDT, J. P et al.SIAM journal on computing (Print). 1998, Vol 27, Num 2, pp 557-582, issn 0097-5397Article

Fast-search: A new efficient variant of the Boyer-Moore string matching algorithmCANTONE, Domenico; FARO, Simone.Lecture notes in computer science. 2003, pp 47-58, issn 0302-9743, isbn 3-540-40205-5, 12 p.Conference Paper

Constant-space string-matching in sublinear average timeCROCHEMORE, M; GASIENIEC, L; RYTTER, W et al.Theoretical computer science. 1999, Vol 218, Num 1, pp 197-203, issn 0304-3975Conference Paper

String matching problems over free partially commutative monoids = Les problèmes de mise en correspondance de chaîne de caractères sur des monoïdes libres partiellement commutatifsHASHIGUCHI, K; YAMADA, K.Information and computation (Print). 1992, Vol 101, Num 2, pp 131-149, issn 0890-5401Article

Compressed Indexes for Approximate String MatchingCHAN, Ho-Leung; LAM, Tak-Wah; SUNG, Wing-Kin et al.Algorithmica. 2010, Vol 58, Num 2, pp 263-281, issn 0178-4617, 19 p.Article

Alphabet dependence in parameterized matchingAMIR, A; FARACH, M; MUTHUKRISHNAN, S et al.Information processing letters. 1994, Vol 49, Num 3, pp 111-115, issn 0020-0190Article

Two-pattern stringsFRANEK, Frantisek; JIANDONG JIANG; WEILIN LU et al.Lecture notes in computer science. 2002, pp 76-84, issn 0302-9743, isbn 3-540-43862-9, 9 p.Conference Paper

Identifying periodic occurrences of a template with applications to protein structureFISCHETTI, V. A; LAUDAU, G. M; SELLERS, P. H et al.Information processing letters. 1993, Vol 45, Num 1, pp 11-18, issn 0020-0190Article

A linear tree edit distance algorithm for similar ordered treesTOUZET, Hélène.Lecture notes in computer science. 2005, pp 334-345, issn 0302-9743, isbn 3-540-26201-6, 12 p.Conference Paper

An on-line string superprimitivity test = Test de superprimitivité de chaîne de caractères en ligneBRESLAUER, D.Information processing letters. 1992, Vol 44, Num 6, pp 345-347, issn 0020-0190Article

Swap and mismatch edit distanceAMIR, Amihood; EISENBERG, Estrella; PORAT, Ely et al.Lecture notes in computer science. 2004, pp 16-27, issn 0302-9743, isbn 3-540-23025-4, 12 p.Conference Paper

An Eades-McKay algorithm for well-formed parentheses stringsBULTENA, B; RUSKEY, F.Information processing letters. 1998, Vol 68, Num 5, pp 255-259, issn 0020-0190Article

String matching problems from bioinformatics which still need better solutions: Extended abstractGONNET, Gaston H.Lecture notes in computer science. 2002, pp 27-30, issn 0302-9743, isbn 3-540-44158-1, 4 p.Conference Paper

Generation of well-formed parenthesis strings in constant worst-case timeWALSH, T. R.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 165-173, issn 0196-6774Article

Efficient indexing algorithms for one-dimensional discretely-scaled stringsPENG, Yung-Hsing; YANG, Chang-Biau; HUANG, Kuo-Si et al.Information processing letters. 2010, Vol 110, Num 16, pp 730-734, issn 0020-0190, 5 p.Article

An algorithm for solving the longest increasing circular subsequence problemDEOROWICZ, Sebastian.Information processing letters. 2009, Vol 109, Num 12, pp 630-634, issn 0020-0190, 5 p.Article

The indexing for one-dimensional proportionally-scaled stringsPENG, Yung-Hsing; YANG, Chang-Biau; TSENG, Chiou-Ting et al.Information processing letters. 2011, Vol 111, Num 7, pp 318-322, issn 0020-0190, 5 p.Article

A faster algorithm for matching a set of patterns with variable length don't caresMENG ZHANG; YI ZHANG; LIANG HU et al.Information processing letters. 2010, Vol 110, Num 6, pp 216-220, issn 0020-0190, 5 p.Article

Using pattern matching for tiling and packing problems : Operations Research Methods for IT-Based ManagementAMINTOOSI, Mahmood; HADI SADOGHI YAZDI; FATHY, Mahmood et al.European journal of operational research. 2007, Vol 183, Num 3, pp 950-960, issn 0377-2217, 11 p.Article

The greedy algorithm for edit distance with movesKAPLAN, Haim; SHAFRIR, Nira.Information processing letters. 2006, Vol 97, Num 1, pp 23-27, issn 0020-0190, 5 p.Article