Name
Abstract | ||
|---|---|---|
In this paper we present an efficient external memory algorithm to compute the string graph from a collection of reads, which is a fundamental data representation used for sequence assembly. Our algorithm builds upon some recent results on lightweight Burrows-Wheeler Transform (BWT) and Longest Common Prefix (LCP) construction providing, as a by-product, an efficient procedure to extend intervals of the BWT that could be of independent interest. We have implemented our algorithm and compared its efficiency against SGA-the most advanced assembly string graph construction program. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-44753-6_23 | ALGORITHMS IN BIOINFORMATICS |
DocType | Volume | ISSN |
Journal | 8701 | 0302-9743 |
Citations | PageRank | References |
5 | 0.42 | 11 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paola Bonizzoni | 1 | 502 | 52.23 |
| Gianluca Della Vedova | 2 | 342 | 36.39 |
| Yuri Pirola | 3 | 128 | 15.79 |
| Marco Previtali | 4 | 22 | 5.45 |
| Raffaella Rizzi | 5 | 130 | 13.58 |