Results 101 to 110 of about 3,327 (143)
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
On the complexity of rearrangement problems under the breakpoint distance. [PDF]
J Comput Biol, 2014 Kováč J.
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
Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets. [PDF]
J Comput BiolMarçais G, DeBlasio D, Kingsford C.
europepmc +1 more source
Parameterized Complexity of Eulerian Deletion Problems. [PDF]
Algorithmica, 2014 Cygan M +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
+6 more sources
Traversing Graphs: The Eulerian and Hamiltonian Theme
, 2000 This chapter deals with basic graph theoretical concepts and then focuses on special topics which are — in their applications — of relevance to theoretical and practical problems in OR. Therefore, this chapter is structured as follows: 1. Basics of Graph Theory. 2. Connectivity, Menger’s Theorem, the Splitting Lemma, and Factors.
Herbert Fleischner
openaire +2 more sources