Author:
Chikhi Rayan,Medvedev Paul,Milanič Martin,Raskhodnikova Sofya
Funder
Boston University
National Science Foundation
Javna Agencija za Raziskovalno Dejavnost RS
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. DNA sequencing, Eulerian graphs, and the exact perfect matching problem;Błażewicz,2002
2. On the recognition of de Bruijn graphs and their induced subgraphs;Błażewicz;Discrete Math.,2002
3. Graph Theory;Bondy,2008
4. Marília D.V. Braga, Joao Meidanis, An algorithm that builds a set of strings given its overlap graph, in: LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Proceedings, April 3-6, 2002, Cancun, Mexico, 2002, pp. 52–63.
5. Optimal assembly for high throughput shotgun sequencing;Bresler;BMC Bioinformatics,2013
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献