The size of subsequence automatonTRONICEK, Zdenek; SHINOHARA, Ayumi.Lecture notes in computer science. 2003, pp 304-310, issn 0302-9743, isbn 3-540-20177-7, 7 p.Conference Paper

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

On the size of DASG for multiple textsCROCHEMORE, Maxime; TRONICEK, Zdenek.Lecture notes in computer science. 2002, pp 58-64, issn 0302-9743, isbn 3-540-44158-1, 7 p.Conference Paper

String processing and information retrieval (13th International conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006)Crestani, Fabio; Ferragina, Paolo; Sanderson, Mark et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-45774-7, 1Vol, XIV-366 p, isbn 3-540-45774-7Conference Proceedings

String processing and information retrieval (12th international conference, SPIRE 2005)Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-29740-5, 1Vol, IX-406 p, isbn 3-540-29740-5Conference Proceedings

Firing policies for an Arabic rule-based stemmerAL SUGHAIYER, Imad A; AL KHARASHI, Ibrahim A.Lecture notes in computer science. 2002, pp 98-103, issn 0302-9743, isbn 3-540-44158-1, 6 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

Computing a longest common subsequence for a set of stringsHSU, W. J; DU, M. W.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 1, pp 45-59, issn 0006-3835Article

String-handling functions for FORTRANBROWN, P. B; SIGWART, C. D.Journal of electrophysiological techniques. 1982, Vol 9, Num 1, pp 3-16, issn 0361-0209Article

Linear time algorithm for the longest common repeat problemLEER, Inbok; ILIOPOULOS, Costas S; PARK, Kunsoo et al.Lecture notes in computer science. 2004, pp 10-17, issn 0302-9743, isbn 3-540-23210-9, 8 p.Conference Paper

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

Compression of character strings by an adaptive dictionaryJAKOBSSON, M.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 4, pp 593-603, issn 0006-3835Article

A simple acceptance/rejection criterium for sequence generators in symmetric cryptographyFUSTER-SABATER, Amparo; CABALLERO-GIL, Pino.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part III, 719-728Conference Paper

Splicing array grammar systemsSUBRAMANIAN, K. G; ROSLIN SAGAYA MARY, A; DERSANAMBIKA, K. S et al.Lecture notes in computer science. 2005, pp 125-135, issn 0302-9743, isbn 3-540-29107-5, 1Vol, 11 p.Conference Paper

Approximate parameterized matchingHAZAY, Carmit; LEWENSTEIN, Moshe; SOKOL, Dina et al.Lecture notes in computer science. 2004, pp 414-425, issn 0302-9743, isbn 3-540-23025-4, 12 p.Conference Paper

First Huffman, then Burrows-Wheeler: A simple alphabet-independent FM-indexGRABOWSKI, Szymon; MÄKINEN, Veli; NAVARRO, Gonzalo et al.Lecture notes in computer science. 2004, pp 210-211, issn 0302-9743, isbn 3-540-23210-9, 2 p.Conference Paper

Evaluating relevance feedback and display strategies for searching on small displaysVINAY, Vishwa; COX, Ingemar J; AILIC-FRAYLING, Natasa et al.Lecture notes in computer science. 2004, pp 131-133, issn 0302-9743, isbn 3-540-23210-9, 3 p.Conference Paper

Experiments with a fast string searching algorithmMØLLER-NIELSEN, P; STAUNSTRUP, J.Information processing letters. 1984, Vol 18, Num 3, pp 129-135, issn 0020-0190Article

Non-approximability of the randomness deficiency functionUSTINOV, Michael A.Lecture notes in computer science. 2006, pp 364-368, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 5 p.Conference Paper

SPIRE 2004 : string processing and information retrieval (Padova, 5-8 October 2004)Apostolico, Alberto; Melucci, Massimo.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23210-9, XIV, 332 p, isbn 3-540-23210-9Conference Proceedings

Toward optimal motif enumerationEVANSL, Patricia A; SMITH, Andrew D.Lecture notes in computer science. 2003, pp 47-58, issn 0302-9743, isbn 3-540-40545-3, 12 p.Conference Paper

Merkle puzzles revisited - finding matching elements between lists. DiscussionCHRISTIANSON, Bruce; WHEELER, David; KUHN, Markus et al.Lecture notes in computer science. 2002, pp 87-94, issn 0302-9743, isbn 3-540-44263-4, 8 p.Conference Paper

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

A compressive code of partial wordCHANGE JIN.International symposium on computerized information retrieval. 2. 1987, pp 168-172Conference Paper

An investigation of different string coding methodsGOYAL, P.Journal of the American Society for Information Science. 1984, Vol 35, Num 4, pp 248-252, issn 0002-8231Article