Locating Maximal Multirepeats in Multiple Strings Under Various Constraints (original) (raw)
Related papers
Identifying Occurrences of Maximal Pairs in Multiple Strings
Lecture Notes in Computer Science, 2002
Efficient repeat finding in sets of strings via suffix arrays
Space efficient search for maximal repetitions
2005
A Simple Algorithm for Finding Exact Common Repeats
IEICE Transactions on Information and Systems, 2007
Repetitions in strings: algorithms and combinatorics
A note on the longest common substring with k-mismatches problem
Information Processing Letters, 2015
A Data-Structure for Approximate Longest Common Subsequence of A Set of Strings
ArXiv, 2020
Efficient repeat finding via suffix arrays
arXiv (Cornell University), 2013
Searching for flexible repeated patterns using a non-transitive similarity relation
Pattern Recognition Letters, 1995
Longest common substrings with k mismatches
Information Processing Letters, 2015
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences, 2004
An all-substrings common subsequence algorithm
Electronic Notes in Discrete Mathematics, 2005
An Algorithm for the Longest Common Subsequence and Substring Problem
Journal of mathematics and informatics, 2022
Longest Common Subsequence in k Length Substrings
Lecture Notes in Computer Science, 2013
String Processing and Information Retrieval
Lecture Notes in Computer Science, 2011
Optimal discovery of subword associations in strings
Discovery Science, 2004
Approximate Multiple String Matching Algorithm
2020
Algorithms for Finding a Minimum Repetition Representation of a String
Lecture Notes in Computer Science, 2010
Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings
2021
An efficient algorithm for finding short approximate non-tandem repeats
Bioinformatics, 2001
New Upper Bounds on Various String Manipulation Problems
2000
Computing minimal and maximal suffixes of a substring revisited
Mathematics, 2021
The Max-Shift Algorithm for Approximate String Matching
Lecture Notes in Computer Science, 2001
Efficient string matching with k mismatches
Theoretical Computer Science, 1986
Sublinear space algorithms for the longest common substring problem
Approximate string matching in sublinear expected time
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
Fast, Practical Algorithms for Computing All the Repeats in a String
Mathematics in Computer Science, 2010
A Variant of Pattern Matching for Multiwords
Large-scale detection of repetitions
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2014
Linear global detectors of redundant and rare substrings
1999
Fast string matching with k differences
Journal of Computer and System Sciences, 1988
On String Matching with Mismatches
Algorithms, 2015