Combinatorial Pattern Matching - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

28

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540690665, 9783540690689

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Two-Dimensional Pattern Matching with Combined Scaling and Rotation

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_4 ◽

2008 ◽

pp. 5-17 ◽

Author(s):

Christian Hundt ◽

Maciej Liśkiewicz

Keyword(s):

Pattern Matching ◽

Two Dimensional

Download Full-text

The Changing Face of Web Search

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_3 ◽

2008 ◽

pp. 4-4

Author(s):

Prabhakar Raghavan

Keyword(s):

Download Full-text

ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_1 ◽

2008 ◽

pp. 1-2

Author(s):

Dan Gusfield

Keyword(s):

Combinatorial Algorithms ◽

Download Full-text

An Improved Succinct Representation for Dynamic k-ary Trees

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_26 ◽

2008 ◽

pp. 277-289 ◽

Author(s):

Diego Arroyuelo

Download Full-text

Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_11 ◽

2008 ◽

pp. 95-106 ◽

Author(s):

Tobias Marschall ◽

Sven Rahmann

Keyword(s):

Pattern Matching

Download Full-text

On the Longest Common Parameterized Subsequence

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_28 ◽

2008 ◽

pp. 303-315

Author(s):

Orgad Keller ◽

Tsvi Kopelowitz ◽

Moshe Lewenstein

Download Full-text

Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_21 ◽

2008 ◽

pp. 217-229

Author(s):

Wojciech Fraczak ◽

Wojciech Rytter ◽

Mohammadreza Yazdani

Keyword(s):

Minimal Sets ◽

Download Full-text

Why Greed Works for Shortest Common Superstring Problem

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_23 ◽

2008 ◽

pp. 244-254 ◽

Author(s):

Bin Ma

Keyword(s):

Shortest Common Superstring ◽

Shortest Common Superstring Problem

Download Full-text

Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_9 ◽

2008 ◽

pp. 69-81 ◽

Author(s):

Mathias Möhl ◽

Sebastian Will ◽

Rolf Backofen

Keyword(s):

Rna Structures ◽

Fixed Parameter Tractable ◽

Fixed Parameter

Download Full-text

On-Line Approximate String Matching with Bounded Errors

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69068-9_14 ◽

2008 ◽

pp. 130-142 ◽

Author(s):

Marcos Kiwi ◽

Gonzalo Navarro ◽

Claudio Telha

Keyword(s):

String Matching ◽

Approximate String Matching ◽

Download Full-text