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
LEADER 03351nmm a2200409 u 4500
001 EB001884243
003 EBX01000000000000001047610
005 00000000000000.0
007 cr|||||||||||||||||||||
008 191115 ||| eng
020 |a 9783540448884 
100 1 |a Baeza-Yates, Ricardo  |e [editor] 
245 0 0 |a Combinatorial Pattern Matching  |h Elektronische Ressource  |b 14th Annual Symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003, Proceedings  |c edited by Ricardo Baeza-Yates, Edgar Chávez, Maxime Crochemore 
250 |a 1st ed. 2003 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2003, 2003 
300 |a XI, 401 p  |b online resource 
505 0 |a 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 
653 |a Coding and Information Theory 
653 |a Coding theory 
653 |a Computer science / Mathematics 
653 |a Discrete Mathematics in Computer Science 
653 |a Information Storage and Retrieval 
653 |a Algorithms 
653 |a Information storage and retrieval systems 
653 |a Information theory 
653 |a Discrete Mathematics 
653 |a Discrete mathematics 
653 |a Automated Pattern Recognition 
653 |a Pattern recognition systems 
700 1 |a Chávez, Edgar  |e [editor] 
700 1 |a Crochemore, Maxime  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-44888-8 
856 4 0 |u https://doi.org/10.1007/3-540-44888-8?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.1 

Similar Items