Combinatorial Pattern Matching - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

35

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540734369, 9783540734376

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Stringology: Some Classic and Some Modern Problems

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_2 ◽

2007 ◽

pp. 2-2

Author(s):

S. Muthukrishnan

Download Full-text

Finding Compact Structural Motifs

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_16 ◽

2007 ◽

pp. 142-149 ◽

Author(s):

Jianbo Qian ◽

Shuai Cheng Li ◽

Dongbo Bu ◽

Ming Li ◽

Jinbo Xu

Keyword(s):

Structural Motifs

Download Full-text

Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_12 ◽

2007 ◽

pp. 95-106 ◽

Author(s):

Sunho Lee ◽

Kunsoo Park

Keyword(s):

Download Full-text

Move-to-Front, Distance Coding, and Inversion Frequencies Revisited

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_10 ◽

2007 ◽

pp. 71-82 ◽

Author(s):

Travis Gagie ◽

Giovanni Manzini

Keyword(s):

Distance Coding ◽

Download Full-text

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_8 ◽

2007 ◽

pp. 52-62 ◽

Author(s):

Philip Bille ◽

Rolf Fagerberg ◽

Inge Li Gørtz

Keyword(s):

Regular Expression ◽

String Matching ◽

Approximate String Matching ◽

Regular Expression Matching

Download Full-text

Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_20 ◽

2007 ◽

pp. 183-194 ◽

Author(s):

Amihood Amir ◽

Oren Kapah ◽

Ely Porat

Keyword(s):

Sparse Data ◽

Fast Convolution ◽

Length Reduction

Download Full-text

Finding Witnesses by Peeling

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_6 ◽

2007 ◽

pp. 28-39 ◽

Author(s):

Yonatan Aumann ◽

Moshe Lewenstein ◽

Noa Lewenstein ◽

Dekel Tsur

Download Full-text

Self-normalised Distance with Don’t Cares

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_9 ◽

2007 ◽

pp. 63-70 ◽

Author(s):

Peter Clifford ◽

Raphaël Clifford

Keyword(s):

Download Full-text

Computing Exact p-Value for Structured Motif

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_18 ◽

2007 ◽

pp. 162-172

Author(s):

Jing Zhang ◽

Xi Chen ◽

Ming Li

Keyword(s):

P Value ◽

Structured Motif

Download Full-text

Two-Dimensional Range Minimum Queries

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73437-6_29 ◽

2007 ◽

pp. 286-294 ◽

Author(s):

Amihood Amir ◽

Johannes Fischer ◽

Moshe Lewenstein

Keyword(s):

Two Dimensional ◽

Dimensional Range

Download Full-text