Abstract
Comparing vertebrate genomes requires efficient cross-species sequence alignment programs. We describe COMBAT, a new mer-based method which can search rapidly for highly similar translated genomic sequences, with the stable-marriage algorithm with incomplete lists (SMI) as a filter scheme. We apply the COMBAT program to the comparative analysis of the human with the most recent bovine genome assemblies, and 84%-95% of the homologous blocks identified by this program are confirmed by BLASTZ. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Sun, B., Schwartz, J. T., Gill, O. H., & Mishra, B. (2006). COMBAT: Search rapidly for highly similar protein-coding sequences using bipartite graph matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3992 LNCS-II, pp. 654–661). Springer Verlag. https://doi.org/10.1007/11758525_89
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
