An Almost Quadratic Time Algorithm for Sparse Spliced Alignment

Yoshifumi Sakai

doi:10.1007/s00224-009-9239-x

An Almost Quadratic Time Algorithm for Sparse Spliced Alignment

Yoshifumi Sakai

農学研究科・生物産業創成科学専攻

研究成果: 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(n^2.25) time, or very recently, in O(n²log ²n) time, by proposing an O(n²log n)-time algorithm.

本文言語	English
ページ（範囲）	189-210
ページ数	22
ジャーナル	Theory of Computing Systems
巻	48
号	1
DOI	https://doi.org/10.1007/s00224-009-9239-x
出版ステータス	Published - 2011 1 1

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics

文献へのアクセス

10.1007/s00224-009-9239-x

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

引用スタイル

@article{1e5f564ceb8f402aad64b2a30679f514,

title = "An Almost Quadratic Time Algorithm for Sparse Spliced Alignment",

abstract = "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.",

keywords = "Common substring alignment, Semi-local string comparison, String algorithm",

author = "Yoshifumi Sakai",

year = "2011",

month = jan,

day = "1",

doi = "10.1007/s00224-009-9239-x",

language = "English",

volume = "48",

pages = "189--210",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - An Almost Quadratic Time Algorithm for Sparse Spliced Alignment

AU - Sakai, Yoshifumi

PY - 2011/1/1

Y1 - 2011/1/1

N2 - 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.

AB - 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.

KW - Common substring alignment

KW - Semi-local string comparison

KW - String algorithm

UR - http://www.scopus.com/inward/record.url?scp=78650974606&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650974606&partnerID=8YFLogxK

U2 - 10.1007/s00224-009-9239-x

DO - 10.1007/s00224-009-9239-x

M3 - Article

AN - SCOPUS:78650974606

VL - 48

SP - 189

EP - 210

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 1

ER -