Circular sequence comparison: algorithms and applications

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

Research output: Contribution to journalArticlepeer-review

21 Citations (Scopus)
198 Downloads (Pure)

Abstract

Sequence comparison is a fundamental step in many important tasks in bioinformatics; from phylogenetic reconstruction to the reconstruction of genomes. Traditional algorithms for measuring approximation in sequence comparison are based on the notions of distance or similarity, and are generally computed through sequence alignment techniques. As circular molecular structure is a common phenomenon in nature, a caveat of the adaptation of alignment techniques for circular sequence comparison is that they are computationally expensive, requiring from super-quadratic to cubic time in the length of the sequences.
Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalAlgorithms for Molecular Biology
Volume11
Issue number1
DOIs
Publication statusPublished - 10 May 2016

Fingerprint

Dive into the research topics of 'Circular sequence comparison: algorithms and applications'. Together they form a unique fingerprint.

Cite this