Sciweavers

730 search results - page 70 / 146
» Combinatorics of Monotone Computations
Sort
View
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
14 years 4 min ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
COCOON
2007
Springer
13 years 11 months ago
Efficient Testing of Forecasts
Each day a weather forecaster predicts a probability of each type of weather for the next day. After n days, all the predicted probabilities and the real weather data are sent to a...
Ching-Lueh Chang, Yuh-Dauh Lyuu
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
13 years 11 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
COCOON
2006
Springer
13 years 11 months ago
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
Sheung-Hung Poon
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
13 years 11 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun