An Almost Quadratic Time Algorithm for Sparse Spliced Alignment

研究成果: Article査読

7 被引用数 (Scopus)

抄録

The sparse spliced alignment problem consists of finding a chain of zero or more exons from O(n) prescribed candidate exons of a DNA sequence of length O(n) that is most similar to a known related gene sequence of length n. This study improves the running time of the fastest known algorithm for this problem to date, which executes in O(n2.25) time, or very recently, in O(n2log 2n) time, by proposing an O(n2log n)-time algorithm.

本文言語English
ページ(範囲)189-210
ページ数22
ジャーナルTheory of Computing Systems
48
1
DOI
出版ステータスPublished - 2011 1 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

フィンガープリント 「An Almost Quadratic Time Algorithm for Sparse Spliced Alignment」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル