Circular sequence comparison with q-grams

DOI10.1007/978-3-662-48221-6_15MaRDI QIDQ5283829zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Roberto Grossi, Costas S. Iliopoulos, Robert Mercaş, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani

Publication date 25 July 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48221-6_15

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Recommendations

• A simple, fast, filter-based algorithm for circular sequence comparison
• Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
• Alignment-free sequence comparison using absent words
• Distance measures for biological sequences: some recent approaches
• Searching and indexing circular patterns

Cites work

• Accurate and efficient methods to improve multiple circular sequence alignment
• Algorithms for jumbled pattern matching in strings
• Algorithms on Strings
• Approximate string-matching with \(q\)-grams and maximal matches
• Finding consensus and optimal alignment of circular strings
• Inducing the LCP-array
• Lossless filter for multiple repetitions with Hamming distance
• On a cyclic string-to-string correction problem
• Suffix Arrays: A New Method for On-Line String Searches
• k-Abelian Pattern Matching

Cited in

(4)

• Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
• Accurate and efficient methods to improve multiple circular sequence alignment
• Searching and indexing circular patterns
• A simple, fast, filter-based algorithm for circular sequence comparison

This page was built for publication: Circular sequence comparison with \(q\)-grams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283829)