Self-alignments in words and their applications

Journal of Algorithms

Volumn 13, Issue 3, 1992, Pages 446-467

  Apostolico, Alberto ^a,b   Szpankowski, Wojciech ^a  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249009042     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(92)90049-I     Document Type: Article

References (31)

1. The myriad virtues of suffix trees
2. Robust transmission of unbounded strings using Fibonacci representations
3. Optimal off-line detection of repetitions in string
4. Structural properties of the string statistics problem
5. Data Structures and Algorithms for the String Statistics Problem
6. An optimal algorithm for computing the repetitions in a word
7. Recherche lineaire d'un carre dans un mot
8. A Note of the Height of Suffix Trees
9. Economical encoding of commas between strings
10. On the performance evaluation of extendible hashing and trie searching
11. String overlaps, pattern matching, and nontransitive games
12. Autocorrelation on Words and Its Applications. Analysis of Suffix Tree by String-Ruler Approach
13. Maximally dependent random variables
14. A class of dependent random variables and their maxima
15. On the complexity of finite sequences
16. A space economical suffix tree construction algorithm
17. An O(n log n) algorithm for finding all repetitions in a string
18. Linear time recognition of square-free strings
19. Asymptotic growth of a class of random trees
20. Linear algorithm for data compression via string matching
21. Some results on V-ary asymmetric tries
22. On the height of digital trees and related topics
23. Patricia tries again revisited
24. Uber die gegenseitige Lage gleicher Teibe gewisser zeichenreichen
25. Linear pattern matching algorithms
26. A universal algorithm for sequential data compression