论文信息 - An Almost Quadratic Time Algorithm for Sparse Spliced Alignment

An Almost Quadratic Time Algorithm for Sparse Spliced Alignment

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.

Yoshifumi Sakai

[1] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[2] Jeanette P. Schmidt,et al. All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings , 1998, SIAM J. Comput..

[3] P. Pevzner,et al. Gene recognition via spliced sequence alignment. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[4] Yoshifumi Sakai. A fast algorithm for multiplying min-sum permutations , 2011, Discret. Appl. Math..

[5] Edson Cáceres,et al. An all-substrings common subsequence algorithm , 2008, Discret. Appl. Math..

[6] Alexander Tiskin,et al. Semi-local String Comparison: Algorithmic Techniques and Applications , 2007, Math. Comput. Sci..

[7] Gad M. Landau,et al. On the Complexity of Sparse Exon Assembly , 2006, J. Comput. Biol..

[8] Alexander Tiskin,et al. Semi-local longest common subsequences in subquadratic time , 2008, J. Discrete Algorithms.

[9] Alexander Tiskin. Faster exon assembly by sparse spliced alignment , 2007, ArXiv.

[10] Gad M. Landau,et al. On the Common Substring Alignment Problem , 2001, J. Algorithms.

[11] 김동규,et al. [서평]「Algorithms on Strings, Trees, and Sequences」 , 2000 .