Matches in Harvard for { <http://id.lib.harvard.edu/aleph/009174619/catalog> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- catalog abstract "The papers contained in this volume were presented at the 14th Annual Sym- sium on Combinatorial Pattern Matching, held June 25–27, 2003 at the Centro Cultural Universitario of the Universidad Michoacana, in Morelia, Michoac´ an, Mexico. They were selected from 57 abstracts submitted in response to the call for papers. In addition, there were invited lectures by Vladimir Levenshtein, from the University of Bergen, Norway, and Ian Munro, from the University of Waterloo, Canada. Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expres- ons, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivialcombinatorialpropertiesofsuchstructuresandtoexploittheseproperties in order to achieve superior performance for the corresponding computational problems. Another important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e?ciently. Over the past decade a steady ?ow of high quality-research on this subject haschangedasparsesetofisolatedresultsintoafull-?edgedareaofalgorithmics. This area is continuing to grow even further due to the increasing demand for speed and e?ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, datacompression,andpatternrecognition.TheobjectiveoftheannualCPM- theringistoprovideaninternationalforumforresearchincombinatorialpattern matching and related applications.".
- catalog alternative "CPM 2003".
- catalog contributor b12927673.
- catalog contributor b12927674.
- catalog contributor b12927675.
- catalog contributor b12927676.
- catalog created "c2003.".
- catalog date "2003".
- catalog date "c2003.".
- catalog dateCopyrighted "c2003.".
- catalog description "Includes bibliographical references and author index.".
- catalog description "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.".
- catalog description "The papers contained in this volume were presented at the 14th Annual Sym- sium on Combinatorial Pattern Matching, held June 25–27, 2003 at the Centro Cultural Universitario of the Universidad Michoacana, in Morelia, Michoac´ an, Mexico. They were selected from 57 abstracts submitted in response to the call for papers. In addition, there were invited lectures by Vladimir Levenshtein, from the University of Bergen, Norway, and Ian Munro, from the University of Waterloo, Canada. Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expres- ons, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivialcombinatorialpropertiesofsuchstructuresandtoexploittheseproperties in order to achieve superior performance for the corresponding computational problems. Another important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e?ciently. Over the past decade a steady ?ow of high quality-research on this subject haschangedasparsesetofisolatedresultsintoafull-?edgedareaofalgorithmics. This area is continuing to grow even further due to the increasing demand for speed and e?ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, datacompression,andpatternrecognition.TheobjectiveoftheannualCPM- theringistoprovideaninternationalforumforresearchincombinatorialpattern matching and related applications.".
- catalog extent "xi, 401 p. :".
- catalog identifier "3540403116 (pbk.)".
- catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 2676".
- catalog issued "2003".
- catalog issued "c2003.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "Coding theory.".
- catalog subject "Combinatorial analysis Congresses.".
- catalog subject "Computational complexity.".
- catalog subject "Computer algorithms Congresses.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Information storage and retrieval systems.".
- catalog subject "Optical pattern recognition.".
- catalog subject "Text processing (Computer science.".
- catalog tableOfContents "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.".
- catalog title "CPM 2003".
- catalog title "Combinatorial pattern matching : 14th annual symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003 : proceedings / Ricardo Baeza-Yates, Edgar Chávez, Maxime Crochemore, eds.".
- catalog type "text".