Results 101 to 110 of about 3,335 (132)

Read mapping on de Bruijn graphs. [PDF]

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

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

Some of the next articles are maybe not open access.

Related searches:

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.
Joan M. Aldous, Robin J. Wilson
exaly   +3 more sources

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs

Journal of Graph Theory, 2003
AbstractIn this paper, we show that if G is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either G has an Eulerian subgraph H such that $S \subseteq V(H)$, or G can be contracted to the Petersen graph in such a way that the preimage of each vertex of the Petersen graph contains at least one vertex in S.
Zhi-Hong Chen, Hong-Jian Lai
exaly   +4 more sources

Eulerian Multigraphs and Hamiltonian Graphs

2007
exaly   +5 more sources

Hamiltonian and Eulerian properties of entire graphs

Lecture Notes in Mathematics, 1972
exaly   +2 more sources

On Eulerian and Hamiltonian Graphs and Line Graphs

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, Nash-Williams, C. S. J. A.   +1 more
openaire   +2 more sources

Usage of Eulerian and Hamiltonian Graph in Pandemic Situation

Journal of Applied Science and Education (JASE), 2021
The existence of Euler and Hamiltonian graph make it easier to solve a real-life problem. During the time of pandemic “Covid-19”, it is very essential for each one of us to be vaccinated. Vaccination is done in the hospitals by using Eulerian and Hamiltonian graphs not only to prevent people from infecting but also to increase the speed of vaccination.
Ambrish Kr. Pandey, Shriya Kanchan
openaire   +1 more source