Circular sequence comparison: algorithms and applications (bibtex)
by Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
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.
Reference:
Circular sequence comparison: algorithms and applications (Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani), In Algorithms for Molecular Biology, volume 11, 2016.
Bibtex Entry:
@Article{Grossi2016,
  author="Grossi, Roberto and Iliopoulos, Costas S. and Mercas, Robert and Pisanti, Nadia and Pissis, Solon P. and Retha, Ahmad and Vayani, Fatima",
  title="Circular sequence comparison: algorithms and applications",
  journal="Algorithms for Molecular Biology",
  year="2016",
  volume="11",
  number="1",
  pages="1--14",
  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.",
  issn="1748-7188",
  doi="10.1186/s13015-016-0076-6",
  url="http://dx.doi.org/10.1186/s13015-016-0076-6"
}
Powered by bibtexbrowser