Abstract
A new algorithm for the construction of physical maps from hybridization fingerprints of short oligonucleotide probes has been developed. Extensive simulations in high-noise scenarios show that the algorithm produces an essentially completely correct map in over 96% of trials. Tests for the influence of specific experimental parameters demonstrate that the algorithm is robust to both false positive and false negative experimental errors. The algorithm was also tested in simulations using real DNA sequences of C. Elegans, E. Coli, S. Cerevisiae and H. Sapiens. To overcome the non-randomness of probe frequencies in these sequences, probes were preselected based on sequence statistics and a screening process of the hybridization data was developed. With these modifications, the algorithm produced very encouraging results on real DNA sequences.
Original language | English |
---|---|
Pages | 268-274 |
Number of pages | 7 |
DOIs | |
State | Published - 1999 |
Event | Proceedings of the 1999 3rd Annual International Conference on Computational Molecular Biology, RECOMB '99 - Lyon Duration: 11 Apr 1999 → 14 Apr 1999 |
Conference
Conference | Proceedings of the 1999 3rd Annual International Conference on Computational Molecular Biology, RECOMB '99 |
---|---|
City | Lyon |
Period | 11/04/99 → 14/04/99 |