Published in
Oxford University Press (OUP), Bioinformatics, 12(26), p. 1481-1487
DOI: 10.1093/bioinformatics/btq229
Links
- ORCID
- Oxford University Press (OUP) | PDF
- [www.ncbi.nlm.nih.gov] | PDF
- [europepmc.org] | PDF
- [www.researchgate.net] | PDF
- [www.ncbi.nlm.nih.gov] | PDF
Tools
A low-polynomial algorithm for assembling clusters of orthologous groups from intergenomic symmetric best matches
Journal article published in 2010 by
David M. Kristensen,
Lavanya Kannan,
Michael K. Coleman,
Yuri I. Wolf,
Alexander Sorokin,
Eugene V. Koonin,
Arcady Mushegian 
This paper is made freely available by the publisher.
Full text: Download
Published version:
archiving forbidden
Data provided by 
Abstract
Motivation: Identifying orthologous genes in multiple genomes is a fundamental task in comparative genomics. Construction of intergenomic symmetrical best matches (SymBets) and joining them into clusters is a popular method of ortholog definition, embodied in several software programs. Despite their wide use, the computational complexity of these programs has not been thoroughly examined.