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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Baeza-Yates, Ricardo (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Chávez, Edgar (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Crochemore, Maxime (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2676
• Θέματα: Discrete mathematics.; Pattern recognition.; Algorithms.; Coding theory.; Information theory.; Computer science-Mathematics.; Information storage and retrieval.; Discrete Mathematics.; Pattern Recognition.; Algorithm Analysis and Problem Complexity.; Coding and Information Theory.; Discrete Mathematics in Computer Science.; Information Storage and Retrieval.

Πίνακας περιεχομένων:

• 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.