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

9783540632207, 9783540692140

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Space- and time-efficient decoding with canonical huffman trees

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_50 ◽

1997 ◽

pp. 65-75 ◽

Cited By ~ 7

Author(s):

Shmuel T. Klein

Keyword(s):

Space And Time ◽

Huffman Trees ◽

Efficient Decoding

Download Full-text

A filter method for the weighted local similarity search problem

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_60 ◽

1997 ◽

pp. 191-205

Author(s):

Enno Ohlebusch

Keyword(s):

Similarity Search ◽

Filter Method ◽

Search Problem ◽

Local Similarity

Download Full-text

An improved pattern matching algorithm for strings in terms of straight-line programs

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_45 ◽

1997 ◽

pp. 1-11 ◽

Cited By ~ 21

Author(s):

Masamichi Miyazaki ◽

Ayumi Shinohara ◽

Masayuki Takeda

Keyword(s):

Pattern Matching ◽

Matching Algorithm ◽

Straight Line ◽

Pattern Matching Algorithm ◽

Straight Line Programs

Download Full-text

An easy case of sorting by reversals

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_52 ◽

1997 ◽

pp. 83-89 ◽

Cited By ~ 3

Author(s):

Nicholas Tran

Keyword(s):

Sorting By Reversals ◽

Easy Case

Download Full-text

Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_62 ◽

1997 ◽

pp. 224-246 ◽

Cited By ~ 2

Author(s):

Marie-France Sagot ◽

Alain Viari

Keyword(s):

Nucleic Acid ◽

Triple Helices ◽

Nucleic Acid Sequences

Download Full-text

On weak circular squares in binary words

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_51 ◽

1997 ◽

pp. 76-82 ◽

Cited By ~ 1

Author(s):

Aviezri S. Fraenkel ◽

Jamie Simpson ◽

Mike Paterson

Download Full-text

Estimating the probability of approximate matches

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_49 ◽

1997 ◽

pp. 52-64 ◽

Cited By ~ 6

Author(s):

Stefan Kurtz ◽

Gene Myers

Download Full-text

On incremental computation of transitive closure and greedy alignment

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_58 ◽

1997 ◽

pp. 167-179 ◽

Cited By ~ 7

Author(s):

Saïd Abdeddaïm

Keyword(s):

Transitive Closure ◽

Incremental Computation

Download Full-text

Aligning coding DNA in the presence of frame-shift errors

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_59 ◽

1997 ◽

pp. 180-190 ◽

Cited By ~ 4

Author(s):

Lars Arvestad

Keyword(s):

Frame Shift

Download Full-text

Approximation algorithms for the fixed-topology phylogenetic number problem

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/3-540-63220-4_56 ◽

1997 ◽

pp. 130-149

Author(s):

Mary Cryan ◽

Leslie Ann Goldberg ◽

Cynthia A. Phillips

Keyword(s):

Approximation Algorithms ◽

Number Problem ◽

Fixed Topology

Download Full-text

Combinatorial Pattern Matching - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Space- and time-efficient decoding with canonical huffman trees

A filter method for the weighted local similarity search problem

An improved pattern matching algorithm for strings in terms of straight-line programs

An easy case of sorting by reversals

Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices

On weak circular squares in binary words

Estimating the probability of approximate matches

On incremental computation of transitive closure and greedy alignment

Aligning coding DNA in the presence of frame-shift errors

Approximation algorithms for the fixed-topology phylogenetic number problem

Combinatorial Pattern Matching - Lecture Notes in Computer Science
Latest Publications