Combinatorial Pattern Matching - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642024405, 9783642024412

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Value of Multiple Read/Write Streams for Data Compression

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_7 ◽

2009 ◽

pp. 68-77 ◽

Cited By ~ 5

Author(s):

Travis Gagie

Keyword(s):

Data Compression

Download Full-text

Permuted Longest-Common-Prefix Array

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_17 ◽

2009 ◽

pp. 181-192 ◽

Cited By ~ 63

Author(s):

Juha Kärkkäinen ◽

Giovanni Manzini ◽

Simon J. Puglisi

Keyword(s):

Common Prefix ◽

Longest Common Prefix Array

Download Full-text

New Complexity Bounds for Image Matching under Rotation and Scaling

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_12 ◽

2009 ◽

pp. 127-141

Author(s):

Christian Hundt ◽

Maciej Liśkiewicz

Keyword(s):

Image Matching ◽

Complexity Bounds

Download Full-text

Quasi-distinct Parsing and Optimal Compression Methods

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_2 ◽

2009 ◽

pp. 12-25 ◽

Cited By ~ 1

Author(s):

Amihood Amir ◽

Yonatan Aumann ◽

Avivit Levy ◽

Yuri Roshko

Download Full-text

Faster and Space-Optimal Edit Distance “1” Dictionary

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_14 ◽

2009 ◽

pp. 154-167 ◽

Cited By ~ 9

Author(s):

Djamal Belazzougui

Keyword(s):

Edit Distance

Download Full-text

Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_15 ◽

2009 ◽

pp. 168-179 ◽

Cited By ~ 3

Author(s):

Kuan-Yu Chen ◽

Ping-Hui Hsu ◽

Kun-Mao Chao

Keyword(s):

Approximate Matching ◽

Run Length

Download Full-text

Statistical Properties of Factor Oracles

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_29 ◽

2009 ◽

pp. 326-338

Author(s):

Jérémie Bourdon ◽

Irena Rusu

Keyword(s):

Statistical Properties

Download Full-text

Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_31 ◽

2009 ◽

pp. 353-367 ◽

Cited By ~ 2

Author(s):

Wei-Bung Wang ◽

Tao Jiang

Download Full-text

LCS Approximation via Embedding into Local Non-repetitive Strings

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_9 ◽

2009 ◽

pp. 92-105

Author(s):

Gad M. Landau ◽

Avivit Levy ◽

Ilan Newman

Download Full-text

Periodic String Comparison

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02441-2_18 ◽

2009 ◽

pp. 193-206 ◽

Cited By ~ 3

Author(s):

Alexander Tiskin

Keyword(s):

String Comparison

Download Full-text

Combinatorial Pattern Matching - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the Value of Multiple Read/Write Streams for Data Compression

Permuted Longest-Common-Prefix Array

New Complexity Bounds for Image Matching under Rotation and Scaling

Quasi-distinct Parsing and Optimal Compression Methods

Faster and Space-Optimal Edit Distance “1” Dictionary

Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard

Statistical Properties of Factor Oracles

Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)

LCS Approximation via Embedding into Local Non-repetitive Strings

Periodic String Comparison

Combinatorial Pattern Matching - Lecture Notes in Computer Science
Latest Publications