An Eulerian path in a directed graph is a path that visits every edge exactly once but does not need to return to the starting node. For a graph to contain an Eulerian path, it must satisfy the ...

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 ...

An Euler path, in a graph or multigraph, is a walk through the graph which uses every edge exactly once. It starts and ends at different vertices. Suppose that a graph has an Euler path P. For every ...

Abstract: With the rapid increase in the size of genome sequence databases, the multiple sequence alignment problem is increasingly important and often requires the alignment of a large number of ...