Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Finding Approximate Repetitions under Hamming Distance
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On Maximal Repetitions in Words
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding approximate repetitions under Hamming distance
Theoretical Computer Science - Logic and complexity in computer science
Locating All Tandem Repeat Families in a Sequence
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Linear-time computation of local periods
Theoretical Computer Science
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
Efficient on-line repetition detection
Theoretical Computer Science
A minimal periods algorithm with applications
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
On suffix extensions in suffix trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
On suffix extensions in suffix trees
Theoretical Computer Science
Fundamenta Informaticae
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics
| Hi-index | 0.00 |