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

Pattern matching for sets of segmentsEFRAT, Alon; INDYK, Piotr; VENKATASUBRAMANIAN, Suresh et al.Algorithmica. 2004, Vol 40, Num 3, pp 147-160, issn 0178-4617, 14 p.Article

Computing suffix links for suffix trees and arraysMAASS, Moritz G.Information processing letters. 2007, Vol 101, Num 6, pp 250-254, issn 0020-0190, 5 p.Article

Three-dimensional periodicity and its application to pattern matchingGALIL, Zvi; JONG GEUN PARK; PARK, Kunsoo et al.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 2, pp 362-381, issn 0895-4801, 20 p.Article

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert AdversariesHAZAY, Carmit; LINDELL, Yehuda.Journal of cryptology. 2010, Vol 23, Num 3, pp 422-456, issn 0933-2790, 35 p.Article

Typed Self-Interpretation by Pattern MatchingJAY, Barry; PALSBERG, Jens.ACM SIGPLAN notices. 2011, Vol 46, Num 9, pp 247-258, issn 1523-2867, 12 p.Conference Paper

Supporting refactoring activities using histories of program modification : Knowledge-based software engineeringHAYASHI, Shinpei; SAEKI, Motoshi; KURIHARA, Masahito et al.IEICE transactions on information and systems. 2006, Vol 89, Num 4, pp 1403-1412, issn 0916-8532, 10 p.Conference Paper

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

Fast matching of large point sets under occlusionsMCAULEY, JulianJ; CAETANO, Tibério S.Pattern recognition. 2012, Vol 45, Num 1, pp 563-569, issn 0031-3203, 7 p.Article

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

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

The Boyer-Moore-Galil string searching strategies revisitedAPOSTOLICO, A; GIANCARLO, R.SIAM journal on computing (Print). 1986, Vol 15, Num 1, pp 98-105, issn 0097-5397Article