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

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

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

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

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

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

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

Swap and mismatch edit distanceAMIR, Amihood; EISENBERG, Estrella; PORAT, Ely et al.Algorithmica. 2006, Vol 45, Num 1, pp 109-120, issn 0178-4617, 12 p.Conference Paper

Identifying occurrences of maximal pairs in multiple stringsILIOPOULOS, Costas S; MAKRIS, Christos; SIOUTAS, Spiros et al.Lecture notes in computer science. 2002, pp 133-143, issn 0302-9743, isbn 3-540-43862-9, 11 p.Conference Paper

On the complexity of deriving position specific Score matrices from examplesAKUTSU, Tatsuya; BANNAI, Hideo; MIYANO, Satoru et al.Lecture notes in computer science. 2002, pp 168-177, issn 0302-9743, isbn 3-540-43862-9, 10 p.Conference Paper

Two-dimensional object recognition through string matchingWU, W-Y.Imaging science journal. 2001, Vol 49, Num 4, pp 213-221, issn 1368-2199Article

All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in stringsSCHMIDT, J. P.SIAM journal on computing (Print). 1998, Vol 27, Num 4, pp 972-992, issn 0097-5397Article

Approximate word sequence matching over Sparse Suffix treesRISVIK, K. M.Lecture notes in computer science. 1998, pp 65-79, issn 0302-9743, isbn 3-540-64739-2Conference Paper

Solving equations in strings : On Makanin's algorithmGUTIERREZ, C.Lecture notes in computer science. 1998, pp 358-373, issn 0302-9743, isbn 3-540-64275-7Conference Paper

Post-editing Experiments with MT for a Controlled LanguageTEMNIKOVA, Irina; ORASAN, Constantin.International symposium on data and sense mining, machine translation and controlled languages, and their application to emergencies and safety critical domains. 2009, pp 249-255, isbn 978-2-8486-7261-8 2-8486-7261-7, 7 p.Conference Paper

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

Average-optimal multiple approximate string matchingFREDRIKSSON, Kimmo; NAVARRO, Gonzalo.Lecture notes in computer science. 2003, pp 109-128, issn 0302-9743, isbn 3-540-40311-6, 20 p.Conference Paper

Faster string matching with super-alphabetsFREDRIKSSON, Kimmo.Lecture notes in computer science. 2002, pp 44-57, issn 0302-9743, isbn 3-540-44158-1, 14 p.Conference Paper

Efficient special cases of pattern matching with swapsAMIR, A; LANDAU, G. M; LEWENSTEIN, M et al.Lecture notes in computer science. 1998, pp 209-220, issn 0302-9743, isbn 3-540-64739-2Conference Paper

String matching on the InternetBRÖNNIMANN, Herve; MEMON, Nasir; SHANMUGASUNDARAM, Kulesh et al.Lecture notes in computer science. 2005, pp 75-89, issn 0302-9743, isbn 3-540-27873-7, 15 p.Conference Paper

Motif extraction from weighted sequencesILIOPOULOS, Costas S; PERDIKURO, Katerina; THEODODDIS, Evangelos et al.Lecture notes in computer science. 2004, pp 286-297, issn 0302-9743, isbn 3-540-23210-9, 12 p.Conference Paper