Sciweavers

CPM
2009
Springer
134views Combinatorics» more  CPM 2009»
14 years 6 months ago
Multiple Alignment of Biological Networks: A Flexible Approach
Yves-Pol Deniélou, Frédéric B...
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
14 years 6 months ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
14 years 6 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman
CPM
2009
Springer
114views Combinatorics» more  CPM 2009»
14 years 6 months ago
Fast RNA Structure Alignment for Crossing Input Structures
Rolf Backofen, Gad M. Landau, Mathias Möhl, D...
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
14 years 6 months ago
Reoptimization of the Shortest Common Superstring Problem
Davide Bilò, Hans-Joachim Böckenhauer,...
CPM
2009
Springer
114views Combinatorics» more  CPM 2009»
14 years 6 months ago
Finding All Sorting Tandem Duplication Random Loss Operations
Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, H...
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
14 years 6 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
14 years 6 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
CPM
2009
Springer
104views Combinatorics» more  CPM 2009»
14 years 6 months ago
New Complexity Bounds for Image Matching under Rotation and Scaling
Christian Hundt, Maciej Liskiewicz