Cover Image
Read Now

Combinatorial Pattern Matching 14th Annual Symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003, Proceedings

Bibliographic Details
Other Authors: Baeza-Yates, Ricardo (Editor), Chávez, Edgar (Editor), Crochemore, Maxime (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2003, 2003
Edition:1st ed. 2003
Series:Lecture Notes in Computer Science
Subjects:
Coding And Information Theory
Coding Theory
Computer Science / Mathematics
Discrete Mathematics In Computer Science
Information Storage And Retrieval
Algorithms
Information Storage And Retrieval Systems
Information Theory
Discrete Mathematics
Automated Pattern Recognition
Pattern Recognition Systems
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Multiple Genome Alignment: Chaining Algorithms Revisited
  • Two-Dimensional Pattern Matching with Rotations
  • An Improved Algorithm for Generalized Comparison of Minisatellites
  • Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions
  • Fast Lightweight Suffix Array Construction and Checking
  • Distributed and Paged Suffix Trees for Large Genetic Databases
  • Analysis of Tree Edit Distance Algorithms
  • An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees
  • Average-Optimal Multiple Approximate String Matching
  • Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms
  • Haplotype Inference by Pure Parsimony
  • A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
  • Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
  • Linear-Time Construction of Suffix Arrays
  • Space Efficient Linear Time Construction of Suffix Arrays
  • Tuning String Matching for Huge Pattern Sets
  • Sparse LCS Common Substring Alignment
  • On Minimizing Pattern Splitting in Multi-track String Matching
  • Alignment between Two Multiple Alignments
  • An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum
  • Pattern Discovery in RNA Secondary Structure Using Affix Trees
  • More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
  • Complexities of the Centre and Median String Problems
  • Extracting Approximate Patterns
  • A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression
  • Constrained Tree Inclusion
  • Working on the Problem of Sorting by Transpositions on Genome Rearrangements
  • Efficient Selection of Unique and Popular Oligos for Large EST Databases

Similar Items