TY - GEN
T1 - Selecting genomes for reconstruction of ancestral genomes
AU - Li, Guoliang
AU - Ma, Jian
AU - Zhang, Louxin
PY - 2007
Y1 - 2007
N2 - It is often impossible to sequence all descendent genomes to reconstruct an ancestral genome. In addition, more genomes do not necessarily give a higher accuracy for the reconstruction of ancestral character states. These facts lead to studying the genome selection for reconstruction problem. In this work, two greedy algorithms for this problem are proposed and tested on computer simulation data as well as a biological example.
AB - It is often impossible to sequence all descendent genomes to reconstruct an ancestral genome. In addition, more genomes do not necessarily give a higher accuracy for the reconstruction of ancestral character states. These facts lead to studying the genome selection for reconstruction problem. In this work, two greedy algorithms for this problem are proposed and tested on computer simulation data as well as a biological example.
UR - http://www.scopus.com/inward/record.url?scp=38349045419&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38349045419&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74960-8_9
DO - 10.1007/978-3-540-74960-8_9
M3 - Conference contribution
AN - SCOPUS:38349045419
SN - 9783540749592
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 110
EP - 121
BT - Comparative Genomics - International Workshop, RECOMB-CG 2007, Proceedings
PB - Springer
T2 - 5th Annual RECOMB Satellite Workshop on Comparative Genomics, RECOMB-CG 2007
Y2 - 16 September 2007 through 18 September 2007
ER -