Results 101 to 110 of about 350 (134)
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
Parameterized Complexity of Eulerian Deletion Problems. [PDF]
Algorithmica, 2014 Cygan M +4 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
Eulerian and Hamiltonian Graphs
Universitext, 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
exaly +6 more sources
On Eulerian and Hamiltonian Graphs and Line Graphs [PDF]
Canadian Mathematical Bulletin, 1965 A graph G has a finite set V of points and a set X of lines each of which joins two distinct points (called its end-points), and no two lines join the same pair of points. A graph with one point and no line is trivial. A line is incident with each of its end-points. Two points are adjacent if they are joined by a line.
Harary, Frank +1 more
openaire +3 more sources