Results 71 to 80 of about 157 (110)
HINGE: long-read assembly achieves optimal repeat resolution. [PDF]
Genome Res, 2017 Kamath GM +4 more
europepmc +1 more source
Bounded Asymmetry in Road Networks. [PDF]
Sci Rep, 2019 Martínez Mori JC, Samaranayake S.
europepmc +1 more source
How to apply de Bruijn graphs to genome assembly. [PDF]
Nat Biotechnol, 2011 Compeau PE, Pevzner PA, Tesler G.
europepmc +1 more source
Computational thinking in life science education. [PDF]
PLoS Comput Biol, 2014 Rubinstein A, Chor B.
europepmc +1 more source
A safe and complete algorithm for metagenomic assembly. [PDF]
Algorithms Mol Biol, 2018 Obscura Acosta N +2 more
europepmc +1 more source
Integer sequence discovery from small graphs. [PDF]
Discrete Appl Math, 2016 Hoppe T, Petrone A.
europepmc +1 more source
On the complexity of rearrangement problems under the breakpoint distance. [PDF]
J Comput Biol, 2014 Kováč J.
europepmc +1 more source
IAVCP (Influenza A Virus Consensus and Phylogeny): Automatic Identification of the Genomic Sequence of the Influenza A Virus from High-Throughput Sequencing Data. [PDF]
VirusesParemskaia AI +2 more
europepmc +1 more source
Read mapping on de Bruijn graphs. [PDF]
BMC Bioinformatics, 2016 Limasset A +3 more
europepmc +1 more source
Ordering Protein Contact Matrices. [PDF]
Comput Struct Biotechnol J, 2018 Xu C +5 more
europepmc +1 more source