Results 101 to 110 of about 3,567 (160)

A safe and complete algorithm for metagenomic assembly. [PDF]

Algorithms Mol Biol, 2018
Obscura Acosta N, Mäkinen V, Tomescu AI.   +2 more
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]

Viruses
Paremskaia AI, Volchkov PY, Deviatkin AA.   +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

Read mapping on de Bruijn graphs. [PDF]

BMC Bioinformatics, 2016
Limasset A, Cazaux B, Rivals E, Peterlongo P.   +3 more
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

Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets. [PDF]

J Comput Biol
Marçais G, DeBlasio D, Kingsford C.
europepmc   +1 more source

Ordering Protein Contact Matrices. [PDF]

Comput Struct Biotechnol J, 2018
Xu C, Bouvier G, Bardiaux B, Nilges M, Malliavin T, Lisser A.   +5 more
europepmc   +1 more source

Parameterized Complexity of Eulerian Deletion Problems. [PDF]

Algorithmica, 2014
Cygan M, Marx D, Pilipczuk M, Pilipczuk M, Schlotter I.   +4 more
europepmc   +1 more source

Review of general algorithmic features for genome assemblers for next generation sequencers. [PDF]

Genomics Proteomics Bioinformatics, 2012
Wajid B, Serpedin E.
europepmc   +1 more source

Eulerian and Hamiltonian Graphs

, 2000
The study of Eulerian graphs was initiated in the 18th century and that of Hamiltonian graphs in the 19th century. These graphs possess rich structures; hence, their study is a very fertile field of research for graph theorists. In this chapter, we present several structure theorems for these graphs.
R. Balakrishnan, K. Ranganathan
semanticscholar   +8 more sources