### Abstract

This paper outlines an algorithm for whole genome order restriction optical map assembly. The algorithm can run very reliably in polynomial time by exploiting a strict limit on the probability that two maps that appear to overlap are in fact unrelated (false positives). The main result of this paper is a tight bound on the false positive probability based on a careful model of the experimental errors in the maps found in practice. Using this false positive probability bound, we show that the probability of failure to compute the correct map can be limited to acceptable levels if the input map error rates satisfy certain sharply delineated conditions. Thus careful experimental design must be used to ensure that whole genome map assembly can be done quickly and reliably.

Original language | English (US) |
---|---|

Title of host publication | Algorithms in Bioinformatics - First International Workshop, WABI 2001 Århus Denmark, August 28-31, 2001 Proceedings |

Editors | Bernard M. E. Moret, Olivier Gascuel |

Publisher | Springer Verlag |

Pages | 27-40 |

Number of pages | 14 |

ISBN (Print) | 3540425160 |

DOIs | |

State | Published - Jan 1 2001 |

Event | 1st International Workshop on Algorithms in Bioinformatics, WABI 2001 - Arhus, Denmark Duration: Aug 28 2001 → Aug 31 2001 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2149 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 1st International Workshop on Algorithms in Bioinformatics, WABI 2001 |
---|---|

Country | Denmark |

City | Arhus |

Period | 8/28/01 → 8/31/01 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Algorithms in Bioinformatics - First International Workshop, WABI 2001 Århus Denmark, August 28-31, 2001 Proceedings*(pp. 27-40). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2149). Springer Verlag. https://doi.org/10.1007/3-540-44696-6_3