Maximal Words in Sequence Comparisons Based on Subword Composition

DOI10.1007/978-3-642-12476-1_2zbMath1284.68689OpenAlexW1822913468MaRDI QIDQ3558256

Alberto Apostolico

Publication date: 4 May 2010

Published in: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12476-1_2

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (5)

Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis ⋮ A framework for space-efficient string kernels ⋮ State Complexity of Prefix Distance ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ State complexity of prefix distance

This page was built for publication: Maximal Words in Sequence Comparisons Based on Subword Composition