Circular sequence comparison with q-grams

DOI10.1007/978-3-662-48221-6_15zbMATH Open1462.68245DBLPconf/wabi/GrossiIMPPRV15OpenAlexW2101033312WikidataQ60315584 ScholiaQ60315584MaRDI QIDQ5283829FDOQ5283829

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Searching and indexing circular patterns
• Accurate and efficient methods to improve multiple circular sequence alignment
• Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
• 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)