Sciweavers

Share
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
Lusheng Wang, Liang Dong, Hui Fan
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
ISAAC
2004
Springer
91views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects
We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribu...
Qingmin Shi, Joseph JáJá
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
ISAAC
2004
Springer
96views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
ISAAC
2004
Springer
100views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Boundary-Optimal Triangulation Flooding
Given a planar triangulation all of whose faces are initially white, we study the problem of colouring the faces black one by one so that the boundary between black and white faces...
Richard J. Nowakowski, Norbert Zeh
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
9 years 8 months ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
books