A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
From MaRDI portal
Recommendations
Cited in
(17)- Lossless filter for multiple repetitions with Hamming distance
- On multiple longest common subsequence and common motifs with gaps (extended abstract)
- Motif trie: an efficient text index for pattern discovery with don't cares
- Computing regularities in strings: a survey
- Indexing factors with gaps
- Motif matching using gapped patterns
- Structural Analysis of Gapped Motifs of a String
- INDEXING GAPPED-FACTORS USING A TREE
- Motif matching using gapped patterns
- Extracting common motifs under the Levenshtein measure: Theory and experimentation
- \textsc{Rime}: repeat identification
- String Processing and Information Retrieval
- Finding Common Motifs with Gaps Using Finite Automata
- A cost-aggregating integer linear program for motif finding
- Finding a set of long common substrings with repeats from m input strings
- Longest \((k]\)-tuple common substrings with interval length constraints
- On the complexity of finding gapped motifs
This page was built for publication: A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714663)