Abstract
Given a set of matches between a cDNA sequence and multiple genomic sequences, we present a subquadratic chaining algorithm for computing an optimal chain of colinear matches, while allowing overlaps between the matches. Our algorithm improves upon the quadratic graph based solution, and extends the previous algorithms which are limited to matches between a cDNA sequence and a single genomic sequence. The matches of the resulting chain serve as anchors for computing a multiple alignment between the cDNA and the given sequences.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abouelhoda, M.I., Ohlebusch, E.: Chaining algorithms and applications in comparative genomics. J. Discrete Algorithms 3(2-4), 321–341 (2005)
Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Enhanced suffix arrays and applicationss. In: Handbook of Computational Molecular Biology, CRC Press, Boca Raton (2006)
Bently, J.L.: K-d trees for semidynamic point sets. In: Proc. of 6th Annual ACM Symposium on Computational Geometry, pp. 187–197. ACM Press, New York (1990)
Chang, W.I., Lawler, E.L.: Sublinear approximate string matching and biological applications. Algorithmica 12(4/5), 327–344 (1994)
Deogen, J.S., Yang, J., Ma, F.: EMAGEN: An efficient approach to multiple genome alignment. In: Proc. of Asia-Pacific Bioinf. Conf. pp. 113–122 (2004)
Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse dynamic programming. I: linear cost functions; II: convex and concave cost functions. J. Assoc. Comput. Mach. 39, 519–567 (1992)
Florea, L., Hartzell, G., Zhang, Z., Rubin, G., Miller, W.: A computer program for aligning a cDNA sequence with a genomic DNA sequence. Genome Research 8, 967–974 (1998)
Kent, W.J.: BLAT—the BLAST-like alignment tool. Genome Research 12, 656–664 (2002)
Messeguer, X., Treangen, T.: M-GCAT: Interactively and efficiently constructing large-scale multiple genome comparison frameworks in closely related species. BMC Bioinformatics 7(433) (2006)
Myers, E.W., Miller, W.: Chaining multiple-alignment fragments in sub-quadratic time. In: Proc. of SODA, pp. 38–47 (1995)
Ohlebusch, E., Kurtz, S.: Space efficient computation of rare maximal exact matches between multiple sequences (submitted, 2007)
Shibuya, S., Kurochkin, I.: Match chaining algorithms for cDNA mapping. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS(LNBI), vol. 2812, pp. 462–475. Springer, Heidelberg (2003)
Zhang, Z., Raghavachari, B., Hardison, R.C., et al.: Chaining multiple-alignment blocks. J. Computional Biology 1, 51–64 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abouelhoda, M. (2007). A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences. In: Ziviani, N., Baeza-Yates, R. (eds) String Processing and Information Retrieval. SPIRE 2007. Lecture Notes in Computer Science, vol 4726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75530-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-75530-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75529-6
Online ISBN: 978-3-540-75530-2
eBook Packages: Computer ScienceComputer Science (R0)