Computing longest common extensions in partial words
- 1 September 2018
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 246, 119-139
Abstract
No abstract availableKeywords
Funding Information
- National Security Agency (H98230-15-1-0232)
- National Science Foundation (DMS–1060775)
This publication has 11 references indexed in Scilit:
- A note on the longest common compatible prefix problem for partial wordsJournal of Discrete Algorithms, 2015
- The longest common extension problem revisited and applications to approximate string searchingJournal of Discrete Algorithms, 2010
- Linear time algorithms for finding and representing all the tandem repeats in a stringJournal of Computer and System Sciences, 2004
- An Algorithm for Approximate Tandem RepeatsJournal of Computational Biology, 2001
- Recursive Star-Tree Parallel Data StructureSIAM Journal on Computing, 1993
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM Journal on Computing, 1988
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984