Name
Abstract | ||
|---|---|---|
The Minimum Path Cover (MinPC) problem on directed acyclic graphs (DAGs) is a classical problem in graph theory that provides a clear and simple mathematical formulation for several applications in computational biology. In this paper, we study the computational complexity of three constrained variants of MinPC motivated by the recent introduction of Next-Generation Sequencing technologies. The fi... |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1093/comjnl/bxu116 | The Computer Journal |
Keywords | DocType | Volume |
minimum path cover,sequence reconstruction,paired-end reads,computational complexity | Journal | 58 |
Issue | ISSN | Citations |
7 | 0010-4620 | 5 |
PageRank | References | Authors |
0.41 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Niko Beerenwinkel | 1 | 696 | 102.47 |
| Stefano Beretta | 2 | 27 | 9.68 |
| Paola Bonizzoni | 3 | 502 | 52.23 |
| Riccardo Dondi | 4 | 89 | 18.42 |
| Yuri Pirola | 5 | 128 | 15.79 |