Dotted suffix trees a structure for approximate text indexing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4209 LNCS, Issue , 2006, Pages 329-336

  Coelho, Luís Pedro ^a   Oliveira, Arlindo L ^a  

^a INESC ID   (Portugal)

Author keywords

Approximate text matching; String algorithms; Suffix trees; Text indexing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PATTERN MATCHING; QUERY LANGUAGES; TEXT PROCESSING; TREES (MATHEMATICS);

STRING ALGORITHMS; SUFFIX TREES; TEXT INDEXING; TEXT MATCHING;

INDEXING (OF INFORMATION);

EID: 33750333129     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11880561_27     Document Type: Conference Paper

References (8)

1. Weiner, P.: Linear pattern matching algorithms. In: FOCS, IEEE (1973) 1-11
2. Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33 (2001)
3. Maaß, M.G., Nowak, J.: Text indexing with erros. In: Proc. 16th Annual Symp. on Combinatorial Pattern Matching (CPM). Volume 3537 of LNCS., Springer (2005) 21-32
4. Chattaraj, A., Parida, L.: An inexact-suffix-tree-based algorithm for detecting extensible patterns. Theor. Comput. Sci. 335 (2005) 3-14
5. Cole, R., Gottlieb, L.A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In; STOC. (2004) 91-100
6. McCreight, E.: A space-economical suffix tree construction algorithm. J. ACM 23 (1976) 262-272
7. Apostolico, A., Szpankowski, W.: Self-alignments in words and their applications. J. Algorithms 13 (1992) 446-467
8. Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York, NY, USA (1997)