Coverart for item
The Resource Combinatorial Pattern Matching : 14th Annual Symposium, CPM 2003 Morelia, Michoacán, Mexico, June 25 27, 2003 Proceedings

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

Label
Combinatorial Pattern Matching : 14th Annual Symposium, CPM 2003 Morelia, Michoacán, Mexico, June 25 27, 2003 Proceedings
Title
Combinatorial Pattern Matching
Title remainder
14th Annual Symposium, CPM 2003 Morelia, Michoacán, Mexico, June 25 27, 2003 Proceedings
Creator
Contributor
Subject
Language
eng
Summary
This book constitutes the refereed proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, CPM 2003, held in Morelia, Michoacn, Mexico in June 2003. The 28 revised full papers presented were carefully reviewed and selected from 57 submissions. The papers are devoted to current theoretical and computational aspects of searching and matching strings and more complicate patterns, such as trees, regular expressions, graphs, point sets, and arrays. Among the application fields addressed are computational biology, bioinformatics, genomics, the Web, data compression, coding, multimedia, information retrieval, pattern recognition, and computer vision
Member of
Cataloging source
DKDLA
http://library.link/vocab/creatorName
Baeza-Yates, R.
Dewey number
005.1
Index
no index present
LC call number
QA76.9.A43
Literary form
non fiction
Nature of contents
  • dictionaries
  • standards specifications
http://library.link/vocab/relatedWorkOrContributorName
  • Chávez, Edgar
  • Crochemore, Maxime
Series statement
Lecture Notes in Computer Science
Series volume
2676,
http://library.link/vocab/subjectName
  • Computer science
  • Coding theory
  • Computer software
  • Computational complexity
  • Text processing (Computer science)
  • Optical pattern recognition
  • Algorithm Analysis and Problem Complexity
  • Coding and Information Theory
  • Discrete Mathematics in Computer Science
  • Information retrieval
  • Document Preparation and Text Processing
  • Pattern perception
  • Information organization
  • Coding theory
  • Computational complexity
  • Computer science
  • Computer software
  • Information storage and retrieval systems
  • Optical pattern recognition
  • Pattern perception
  • Text processing (Computer science)
Label
Combinatorial Pattern Matching : 14th Annual Symposium, CPM 2003 Morelia, Michoacán, Mexico, June 25 27, 2003 Proceedings
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
756603377
Extent
1 online resource.
Form of item
online
Isbn
9783540403111
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Specific material designation
remote
System control number
(OCoLC)756603377
Label
Combinatorial Pattern Matching : 14th Annual Symposium, CPM 2003 Morelia, Michoacán, Mexico, June 25 27, 2003 Proceedings
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
756603377
Extent
1 online resource.
Form of item
online
Isbn
9783540403111
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Specific material designation
remote
System control number
(OCoLC)756603377

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...