Fast and Efficient Rmap Assembly Using the Bi-Labelled de Bruijn Graph (English)
Free access
- New search for: Mukherjee, Kingshuk
- Further information on Mukherjee, Kingshuk:
- https://orcid.org/0000-0002-1647-8741
- New search for: Rossi, Massimiliano
- Further information on Rossi, Massimiliano:
- https://orcid.org/0000-0002-3012-1394
- New search for: Salmela, Leena
- Further information on Salmela, Leena:
- https://orcid.org/0000-0002-0756-543X
- New search for: Boucher, Christina
- Further information on Boucher, Christina:
- https://orcid.org/0000-0001-9509-9725
- New search for: Mukherjee, Kingshuk
- Further information on Mukherjee, Kingshuk:
- https://orcid.org/0000-0002-1647-8741
- New search for: Rossi, Massimiliano
- Further information on Rossi, Massimiliano:
- https://orcid.org/0000-0002-3012-1394
- New search for: Salmela, Leena
- Further information on Salmela, Leena:
- https://orcid.org/0000-0002-0756-543X
- New search for: Boucher, Christina
- Further information on Boucher, Christina:
- https://orcid.org/0000-0001-9509-9725
- New search for: Kingsford, Carl
- Further information on Kingsford, Carl:
- https://orcid.org/0000-0002-0118-5516
- New search for: Pisanti, Nadia
- Further information on Pisanti, Nadia:
- https://orcid.org/0000-0003-3915-7665
In:
LIPIcs, Volume 172, WABI 2020
: 20th International Workshop on Algorithms in Bioinformatics (WABI 2020)
;
172
;
9:1-9:16
;
2020
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:Fast and Efficient Rmap Assembly Using the Bi-Labelled de Bruijn Graph
-
Contributors:Mukherjee, Kingshuk ( author ) / Rossi, Massimiliano ( author ) / Salmela, Leena ( author ) / Boucher, Christina ( author ) / Kingsford, Carl ( editor ) / Pisanti, Nadia ( editor )
-
Published in:LIPIcs, Volume 172, WABI 2020 : 20th International Workshop on Algorithms in Bioinformatics (WABI 2020) ; 172 ; 9:1-9:16Leibniz International Proceedings in Informatics (LIPIcs) ; 172 ; 9:1-9:16
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2020-08-25
-
Size:16 pages , 931141 byte
-
Remarks:LIPIcs, Vol. 172, 20th International Workshop on Algorithms in Bioinformatics (WABI 2020), pages 9:1-9:16
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Conference paper
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Approximate Search for Known Gene Clusters in New Genomes Using PQ-TreesZimerman, Galia R. / Svetlitsky, Dina / Zehavi, Meirav / Ziv-Ukelson, Michal et al. | 2020
- 2
-
An Interpretable Classification Method for Predicting Drug Resistance in M. TuberculosisZabeti, Hooman / Dexter, Nick / Safari, Amir Hosein / Sedaghat, Nafiseh / Libbrecht, Maxwell / Chindelevitch, Leonid et al. | 2020
- 3
-
Natural Family-Free Genomic DistanceRubert, Diego P. / Martinez, Fábio V. / Braga, Marília D. V. et al. | 2020
- 4
-
Fast Lightweight Accurate Xenograft SortingZentgraf, Jens / Rahmann, Sven et al. | 2020
- 5
-
Phyolin: Identifying a Linear Perfect Phylogeny in Single-Cell DNA Sequencing Data of TumorsWeber, Leah L. / El-Kebir, Mohammed et al. | 2020
- 6
-
The Longest Run Subsequence ProblemSchrinner, Sven / Goel, Manish / Wulfert, Michael / Spohr, Philipp / Schneeberger, Korbinian / Klau, Gunnar W. et al. | 2020
- 7
-
Linear Time Construction of Indexable Founder Block GraphsMäkinen, Veli / Cazaux, Bastien / Equi, Massimo / Norri, Tuukka / Tomescu, Alexandru I. et al. | 2020
- 8
-
GraphBin2: Refined and Overlapped Binning of Metagenomic Contigs Using Assembly GraphsMallawaarachchi, Vijini G. / Wickramarachchi, Anuradha S. / Lin, Yu et al. | 2020
- 9
-
Fast and Efficient Rmap Assembly Using the Bi-Labelled de Bruijn GraphMukherjee, Kingshuk / Rossi, Massimiliano / Salmela, Leena / Boucher, Christina et al. | 2020
- 10
-
Economic Genome Assembly from Low Coverage Illumina and Nanopore DataGatter, Thomas / von Löhneysen, Sarah / Drozdova, Polina / Hartmann, Tom / Stadler, Peter F. et al. | 2020
- 11
-
A Graph-Theoretic Barcode Ordering Model for Linked-ReadsDufresne, Yoann / Sun, Chen / Marijon, Pierre / Lavenier, Dominique / Chauve, Cedric / Chikhi, Rayan et al. | 2020
- 12
-
Exact Transcript Quantification Over Splice GraphsMa, Cong / Zheng, Hongyu / Kingsford, Carl et al. | 2020
- 13
-
Shape Decomposition Algorithms for Laser Capture MicrodissectionSelbach, Leonie / Kowalski, Tobias / Gerwert, Klaus / Buchin, Maike / Mosig, Axel et al. | 2020
- 14
-
The Bourque Distances for Mutation Trees of CancersJahn, Katharina / Beerenwinkel, Niko / Zhang, Louxin et al. | 2020
- 15
-
Advancing Divide-And-Conquer Phylogeny Estimation Using Robinson-Foulds SupertreesYu, Xilin / Le, Thien / Christensen, Sarah / Molloy, Erin K. / Warnow, Tandy et al. | 2020
- 16
-
Disk Compression of k-mer SetsRahman, Amatur / Chikhi, Rayan / Medvedev, Paul et al. | 2020
- 17
-
Near-Linear Time Edit Distance for Indel ChannelsGanesh, Arun / Sy, Aaron et al. | 2020
- 18
-
Fold Family-Regularized Bayesian Optimization for Directed Protein EvolutionFrisby, Trevor S. / Langmead, Christopher J. et al. | 2020
- 19
-
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced TranslocationsCantone, Domenico / Faro, Simone / Pavone, Arianna et al. | 2020