On the length of the minimum solution of word equations in one variableBABA, Kensuke; TSURUTA, Satoshi; SHINOHARA, Ayumi et al.Lecture notes in computer science. 2003, pp 189-197, issn 0302-9743, isbn 3-540-40671-9, 9 p.Conference Paper

An analysis of the Karp-Rabin string matching algorithmGONNET, G. H; BAEZA-YATES, R. A.Information processing letters. 1990, Vol 34, Num 5, pp 271-274, issn 0020-0190Article

CPM 2004 : combinatorial pattern matching (Istanbul, 5-7 July 2004)Sahinalp, Suleyman Cenk; Muthukrishnan, S; Dogrusoz, Ugur et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22341-X, XI, 486 p, isbn 3-540-22341-XConference Proceedings

A framework to animate string algorithmsBAEZA-YATES, R. A; FUENTES, L. O.Information processing letters. 1996, Vol 59, Num 5, pp 241-244, issn 0020-0190Article

Finding all common intervals of k permutationsHEBER, Steffen; STOYE, Jens.Lecture notes in computer science. 2001, pp 207-218, issn 0302-9743, isbn 3-540-42271-4Conference Paper

CPM : combinatorial pattern matching (Aarhus, June 30 - July 2, 1997)Apostolico, Alberto; Hein, Jotun.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63220-4, VIII, 274 p, isbn 3-540-63220-4Conference Proceedings

An easy case of sorting by reversalsTRAN, N.Lecture notes in computer science. 1997, pp 83-89, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Efficient algorithms for approximate string matching with swapsLEE, J.-S; DONG KYUE KIM; PARK, K et al.Lecture notes in computer science. 1997, pp 28-38, issn 0302-9743, isbn 3-540-63220-4Conference Paper

The undecidability of pattern matching in calculi where primitive recursive functions are representable = L'indécidabilité de la concordance de forme dans les calculs où les fonctions récursives sont représentablesDOWEK, G.Theoretical computer science. 1993, Vol 107, Num 2, pp 349-356, issn 0304-3975Article

Pattern matching expands visual inspectionMULLINER, Jason.Laser focus world. 2001, Vol 37, Num 8, pp 197-201, issn 1043-8092, 3 p.Article

Efficient special cases of Pattern Matching with SwapsAMIR, A; LANDAU, G. M; LEWENSTEIN, M et al.Information processing letters. 1998, Vol 68, Num 3, pp 125-132, issn 0020-0190Article

Dynamic text indexing under string updatesFERRAGINA, P.Journal of algorithms (Print). 1997, Vol 22, Num 2, pp 296-328, issn 0196-6774Article

An improved pattern matching algorithm for strings in terms of straight-line programsMIYAZAKI, M; SHINOHARA, A; TAKEDA, M et al.Lecture notes in computer science. 1997, pp 1-11, issn 0302-9743, isbn 3-540-63220-4Conference Paper

External inverse pattern matchingGASIENIEC, L; INDYK, P; KRYSTA, P et al.Lecture notes in computer science. 1997, pp 90-101, issn 0302-9743, isbn 3-540-63220-4Conference Paper

On incremental computation of transitive closure and greedy alignmentABDEDDAÏM, S.Lecture notes in computer science. 1997, pp 167-179, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Segmentation of lines and arcs and its application for depth recoveryBESS, R; PAULUS, D; HARBECK, M et al.International conference on acoustics, speech, and signal processing. 1997, pp 3165-3168, isbn 0-8186-7919-0Conference Paper

Randomized algorithms for the on-line minimum matching problem on Euclidean spaceYING TEH TSAI; CHUAN YI TANG; YUNN YEN CHEN et al.International journal of computer mathematics. 1995, Vol 58, Num 1-2, pp 19-32, issn 0020-7160Article

A filter method for the weighted local similarity search problemOHLEBUSCH, E.Lecture notes in computer science. 1997, pp 191-205, issn 0302-9743, isbn 3-540-63220-4Conference Paper

A new algorithm for the ordered tree inclusion problemRICHTER, T.Lecture notes in computer science. 1997, pp 150-166, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Distributed generation of suffix arraysNAVARRO, G; KITAJIMA, J. P; RIBEIRO-NETO, B. A et al.Lecture notes in computer science. 1997, pp 102-115, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Episode matchingDAS, G; FLEISCHER, R; GASIENIEC, L et al.Lecture notes in computer science. 1997, pp 12-27, issn 0302-9743, isbn 3-540-63220-4Conference Paper

On the complexity of pattern matching for highly compressed two-dimensional textsBERMAN, P; KARPINSKI, M; LARMORE, L. L et al.Lecture notes in computer science. 1997, pp 40-51, issn 0302-9743, isbn 3-540-63220-4Conference Paper

On weak circular squares in binary wordsFRAENKEL, A. S; SIMPSON, J; PATERSON, M et al.Lecture notes in computer science. 1997, pp 76-82, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Fast two-dimensional pattern matchingBAEZA-YATES, R; REGNIER, M.Information processing letters. 1993, Vol 45, Num 1, pp 51-57, issn 0020-0190Article

Finding Patterns with Variable Length Gaps or Don't CaresSOHEL RAHMAN, M; ILIOPOULOS, Costas S; LEE, Inbok et al.Lecture notes in computer science. 2006, pp 146-155, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper