de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Dokument suchen
Gusfield, Dan; Stoye, Jens: Linear time algorithms for finding and representing all the tandem repeats in a string. In: Journal of computer and system sciences. Jg.69 H. 4. 2004, S. 525-546
Inhalt
Terminology and technical background
The size of the vocabulary
Background on suffix trees
Phase I: Finding a leftmost covering set
Algorithm 1: Processing block B
Phase II: Marking the endpoints of some tandem repeat types
Phase III: Using Qprime to record the endpoints of the full vocabulary
Analysis of Phase III
Correctness
Time and space analysis of Phase III
Extensions of the basic algorithm
Many immediate extensions
Primitive tandem repeats
Tandem arrays
The first phase
The second phase
Algorithm 3
Analysis of Algorithm 3
Final extension
Conclusion
References