Maximum Likelihood Genome Assembly

@article{Medvedev2009MaximumLG,
  title={Maximum Likelihood Genome Assembly},
  author={Paul Medvedev and Michael Brudno},
  journal={Journal of computational biology : a journal of computational molecular cell biology},
  year={2009},
  volume={16 8},
  pages={1101-16}
}
Whole genome shotgun assembly is the process of taking many short sequenced segments (reads) and reconstructing the genome from which they originated. We demonstrate how the technique of bidirected network flow can be used to explicitly model the double-stranded nature of DNA for genome assembly. By combining an algorithm for the Chinese Postman Problem on bidirected graphs with the construction of a bidirected de Bruijn graph, we are able to find the shortest double-stranded DNA sequence that… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 56 extracted citations

Similar Papers

Loading similar papers…