Skip to main content
SpringerLink
Log in

An Almost Quadratic Time Algorithm for Sparse Spliced Alignment

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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(n 2.25) time, or very recently, in O(n 2log 2 n) time, by proposing an O(n 2log n)-time algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alves, C.E.R., Cáceres, E.N., Song, S.W.: An all-substrings common subsequence algorithm. Electr. Notes Discrete Math. 19, 133–139 (2005)

    Article  Google Scholar 

  2. Gelfand, M.S., Mironov, A.A., Pevzner, P.A.: Gene recognition via spliced sequence alignment. Proc. Nat. Acad. Sci. 93, 9061–9066 (1996)

    Article  Google Scholar 

  3. Gusfield, G.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  4. Gabow, H.N., Tarjan, R.E.: A linear time algorithm for a special case of disjoint set union. J. Comp. Syst. Sci. 30, 209–221 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kent, C., Landau, G.M., Ziv-Ukelson, M.: On the complexity of sparse exon assembly. J. Comput. Biol. 13, 1013–1027 (2006)

    Article  MathSciNet  Google Scholar 

  6. Landau, G.M., Ziv-Ukelson, M.: On the common substring alignment problem. J. Algorithms 41, 338–359 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Sakai, Y.: A fast algorithm for multiplying min-sum permutations, submitted

  8. Schmidt, J.P.: All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM J. Comput. 27, 972–992 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Tiskin, A.: Faster exon assembly by sparse spliced alignment. Technical Report. arXiv:0707.3409

  10. Tiskin, A.: Semi-local longest common subsequences in subquadratic time. J. Discrete Algorithms 6, 570–581 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  11. Tiskin, A.: Semi-local string comparison: algorithmic techniques and applications. Math. Comput. Sci. 1, 571–603 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Tiskin, A.: Semi-local string comparison: Algorithmic techniques and applications. http://arxiv.org/abs/0707.3619

Download references

Author information

Authors and Affiliations

  1. Graduate School of Agricultural Science, Tohoku University, 1-1 Amamiya-machi, Tsutsumidori, Aoba-ku, Sendai, 981-8555, Japan

    Yoshifumi Sakai

Authors
  1. Yoshifumi Sakai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yoshifumi Sakai.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sakai, Y. An Almost Quadratic Time Algorithm for Sparse Spliced Alignment. Theory Comput Syst 48, 189–210 (2011). https://doi.org/10.1007/s00224-009-9239-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-009-9239-x

Keywords

Search

Navigation