13 search results - page 2 / 3 » Common Structured Patterns in Linear Graphs: Approximation a... |
GCB
2004
Springer
14 years 23 days ago
2004
Springer
: We introduce the novel concept of graph alignment, a generalization of graph isomorphism that is motivated by the commonly used multiple sequence alignments. Graph alignments and...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
IPCO
2008
13 years 8 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ALMOB
2006
13 years 7 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
ICRA
2003
IEEE
14 years 20 days ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...