Sciweavers

106
Voted
CPM
2008
Springer
170views Combinatorics» more  CPM 2008»
15 years 2 months ago
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Nadja Betzler, Michael R. Fellows, Christian Komus...
114
Voted
CPM
2008
Springer
154views Combinatorics» more  CPM 2008»
15 years 2 months ago
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
Mathias Möhl, Sebastian Will, Rolf Backofen
CPM
2008
Springer
149views Combinatorics» more  CPM 2008»
15 years 2 months ago
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Let G be an unweighted and undirected graph of n nodes, and let D be the n
Igor Nitto, Rossano Venturini
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 2 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
114
Voted
CPM
2008
Springer
143views Combinatorics» more  CPM 2008»
15 years 2 months ago
A Black Box for Online Approximate Pattern Matching
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
Raphaël Clifford, Klim Efremenko, Benny Porat...
Combinatorics
Top of PageReset Settings