Results 11 to 20 of about 1,608,691 (253)

An Eulerian path approach to local multiple alignment for DNA sequences. [PDF]

Proc Natl Acad Sci U S A, 2005
Expensive computation in handling a large number of sequences limits the application of local multiple sequence alignment. We present an Eulerian path approach to local multiple alignment for DNA sequences. The computational time and memory usage of this approach is approximately linear to the total size of sequences analyzed; hence, it can handle ...
Zhang Y, Waterman MS.
europepmc   +7 more sources

An Eulerian path approach to DNA fragment assembly. [PDF]

Proc Natl Acad Sci U S A, 2001
For the last 20 years, fragment assembly in DNA sequencing followed the “overlap–layout–consensus” paradigm that is used in all currently available assembly tools. Although this approach proved useful in assembling clones, it faces difficulties in genomic shotgun assembly.
Pevzner PA, Tang H, Waterman MS.
europepmc   +6 more sources

New Ideas in Recognition of Cancer and Neutrosophic Super Hyper Graph by Eulerian-Path-Cut as Hyper Eulogy-Path-Cut on Super EULA-Path-Cut

International Journal of Pure and Applied Mathematics Research, 2023
\documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfonts, amssymb, graphicx, tikz, color} \usepackage[bookmarksnumbered, colorlinks, plainpages]{hyperref} % use Unicode characters - try changing the option if you run into troubles with special
Henry Garrett
semanticscholar   +5 more sources

Eulerian Paths with Regular Constraints [PDF]

, 2016
Labeled graphs, in which edges are labeled by letters from some alphabet Sigma, are extensively used to model many types of relations associated with actions, costs, owners, or other properties.
Kupferman, Orna, Vardi, Gal
core   +5 more sources

Path decompositions of Eulerian graphs [PDF]

Discrete Mathematics
Gallai's conjecture asserts that every connected graph on $n$ vertices can be decomposed into $\frac{n+1}{2}$ paths. For general graphs (possibly disconnected), it was proved that every graph on $n$ vertices can be decomposed into $\frac{2n}{3}$ paths. This is also best possible (consider the graphs consisting of vertex-disjoint triangles).
Yanan Chu, Yan Wang
semanticscholar   +4 more sources

A general implementation of Eulerian path

, 2015
Implementation report of an Eulerian path function for general graphs.
S. R. Edwardo, Ortiz-Zuazaga Humberto
semanticscholar   +4 more sources

A Feasibility Study on Application of Eulerian Path Concept to Design of Water Supply Pipe Network [PDF]

대한환경공학회지, 2022
Objectives This study attempted to investigated the advantages that can be obtained by applying the concept of ‘Eulerian path’ called ‘one-touch drawing’ to the block type water supply network which actually has been operating in Korea.
Sukmin Yoon, Hong Rae Kil, Doo Yong Choi, Jong-Oh Kim, No-Suk Park   +4 more
doaj   +2 more sources

Edge-Disjoint Paths in Eulerian Digraphs [PDF]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Disjoint paths problems are among the most prominent problems in combinatorial optimisation. The edge- as well as the Vertex-Disjoint Paths problem are NP-complete, both on directed and undirected graphs. But on undirected graphs, Robertson and Seymour developed an algorithm for both problems that runs in cubic time for every fixed number ‍p of ...
Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer   +2 more
  +6 more sources

Note on Long Paths in Eulerian Digraphs [PDF]

The Electronic Journal of Combinatorics, 2021
Long paths and cycles in Eulerian digraphs have received a lot of attention recently. In this short note, we show how to use methods from [Knierim, Larcher, Martinsson, Noever, JCTB 148:125--148] to find paths of length $d/(\log d+1)$ in Eulerian digraphs with average degree $d$, improving  the recent result of $\Omega(d^{1/2+1/40})$.
Knierim, Charlotte, Larcher, Maxime, Martinsson, Anders   +2 more
openaire   +4 more sources

Eulerian-Path-Cut In SuperHyperGraphs

, 2023
[ADDRESSED CITATION] [HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7812750). In this scientific research book, there are some scientific research chapters on “Extreme Eulerian-Path-Cut In SuperHyperGraphs ” and “Neutrosophic Eulerian-Path-Cut In SuperHyperGraphs ” about some scientific ...
Henry Garrett
openaire   +2 more sources