Longest repeats with a block of don't cares

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

Volumn 2976, Issue , 2004, Pages 271-278

  Crochemore, Maxime ^a,b   Iliopoulos, Costas S ^b   Mohamed, Manal ^b   Sagot, Marie France ^c  

^a Université de Marne la Vallée   (France)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITÉ LYON 1   (France)

Author keywords

Combinatorial Problems; Don't Care; Efficient Merging; Lowest Common Ancestor; Repeat Extraction; String; Suffix Tree

Indexed keywords

ALGORITHMS; FORESTRY; QUERY PROCESSING;

COMBINATORIAL PROBLEM; CONSTANT TIME; LOWEST COMMON ANCESTORS; STRING; SUFFIX-TREES;

TREES (MATHEMATICS);

EID: 33750953361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_31     Document Type: Article

References (10)

1. Adel'son-Vel'skii, G.M., Landis, Y.M.: An Algorithm for the Organisation of Information. Doklady Akademii Nauk SSSR, Vol. 146 (1962) 263-266
2. Brodal, G.S., Lyngsø, R.B., Pedersen, C.N.S., Stoye, J.: Finding Maximal Pairs with Bounded Gaps. Journal of Discrete Algorithms, Special Issue of Matching Patterns, Vol. 11 (2000) 77-104
3. Brown, M.R., Tarjan, R.E.: A Fast Merging Algorithm. Journal of the ACM, Vol. 26 2 (1979) 211-226
4. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific (2002)
5. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge Univesity Press (1997)
6. Iliopoulos, C.S., Markis, C., Sioutas, S., Tsakalidis, A., Tsichlas, K.: Identififying Ocuurences of Maximal Pairs in Multiple Strings. CPM (2002) 133-143.
7. LNCS Vol. 2373 (2002) 133-143
8. Kolpakov, R., Kucherov, G.: Finding Repeats with Fixed Gap. SPIRE (2002) 162-168
9. Schieber, B., Vishkin, U.: On Finding Lowest Common Ancestors: Simplifications and Parallization. SIAM Journal of Computation, Vol. 17 (1988) 1253-1262
10. Stoye, J.: Affix Trees. Diploma Thesis, Universität Bielefeld, Forschungsbericht der Technischen Fakultät, Abteilung Informationstechnik, Report 2000-04 (2000) (ISSN 0946-7831)