This book constitutes the refereed proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006, held in Barcelona, Spain, July 2006. The book presents 33 revised full papers together with 3 invited talks, organized in topical sections on data structures, indexing data structures, probabilistic and algebraic techniques, applications in molecular biology, string matching, data compression, and dynamic programming.

Produktinformation

Utgivningsdatum2006-06-26
Mått152 x 229 x 24 mm
Vikt651 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor420
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540354550

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

Asynchronous Pattern Matching.- Asynchronous Pattern Matching.- SNP and Haplotype Analysis – Algorithms and Applications.- Identifying Co-referential Names Across Large Corpora.- Session 1. Data Structures.- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.- Session 2. Indexing Data Structures.- A Linear Size Index for Approximate Pattern Matching.- On-Line Linear-Time Construction of Word Suffix Trees.- Obtaining Provably Good Performance from Suffix Trees in Secondary Storage.- Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures.- Session 3. Probabilistic and Algebraic Techniques.- New Bounds for Motif Finding in Strong Instances.- Fingerprint Clustering with Bounded Number of Missing Values.- Tiling an Interval of the Discrete Line.- Common Substrings in Random Strings.- Session 4. Applications in Molecular Biology I.- On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem.- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms.- Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees.- An Improved Algorithm for the Macro-evolutionary Phylogeny Problem.- Session 5. String Matching I.- Property Matching and Weighted Matching.- Faster Two Dimensional Scaled Matching.- Session 6. Applications in Molecular Biology II.- Approximation of RNA Multiple Structural Alignment.- Finding Common RNA Pseudoknot Structures in Polynomial Time.- A Compact Mathematical Programming Formulation for DNA Motif Finding.- Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.- Session 7. Applications in MolecularBiology III.- An Algorithm for Sorting by Reciprocal Translocations.- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.- Session 8. Data Compression.- A Simpler Analysis of Burrows-Wheeler Based Compression.- Statistical Encoding of Succinct Data Structures.- Dynamic Entropy-Compressed Sequences and Full-Text Indexes.- Reducing the Space Requirement of LZ-Index.- Session 9. String Matching II.- Faster Algorithms for Computing Longest Common Increasing Subsequences.- New Algorithms for Text Fingerprinting.- Sublinear Algorithms for Parameterized Matching.- Approximate Matching in Weighted Sequences.- Session 10. Dynamic Programming.- Algorithms for Finding a Most Similar Subforest.- Efficient Algorithms for Regular Expression Constrained Sequence Alignment.- Large Scale Matching for Position Weight Matrices.

Mer från samma författare

Del 8214

String Processing and Information Retrieval

Oren Kurland, Moshe Lewenstein, Ely Porat

Häftad, 2013

749 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av

Combinatorial Pattern Matching

Amihood Amir, Laxmi Parida

Häftad, 2010

729 kr

Combinatorial Pattern Matching

Bin Ma, Kaizhong Zhang

Häftad, 2007

749 kr

Combinatorial Pattern Matching

Paolo Ferragina, Gad M. Landau

Häftad, 2008

729 kr

Combinatorial Pattern Matching

Dan Hirschberg, Gene Meyers

Häftad, 1996

729 kr

Combinatorial Pattern Matching

Zvi Galil, Esko Ukkonen

Häftad, 1995

749 kr

Combinatorial Pattern Matching

Suleyman C. Sahinalp, S. Muthukrishnan, Ugur Dogrusoz

Häftad, 2004

749 kr

Combinatorial Pattern Matching

Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber

Häftad, 1993

709 kr

Combinatorial Pattern Matching

Raffaele Giancarlo, David Sankoff

Häftad, 2000

749 kr

Del 8486

Combinatorial Pattern Matching

Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner

Häftad, 2014

729 kr

Combinatorial Pattern Matching

Alberto Apostolico, Masayuki Takeda

Häftad, 2002

729 kr

Del i serien Lecture Notes in Computer Science

Combinatorial Pattern Matching

17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings

Häftad, Engelska, 2006

AvMoshe Lewenstein,Gabriel Valiente

749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

679 kr

Skickas inom 10-15 vardagar

Häftad

709 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2006-06-26
Mått152 x 229 x 24 mm
Vikt651 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor420
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540354550

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

Asynchronous Pattern Matching.- Asynchronous Pattern Matching.- SNP and Haplotype Analysis – Algorithms and Applications.- Identifying Co-referential Names Across Large Corpora.- Session 1. Data Structures.- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.- Session 2. Indexing Data Structures.- A Linear Size Index for Approximate Pattern Matching.- On-Line Linear-Time Construction of Word Suffix Trees.- Obtaining Provably Good Performance from Suffix Trees in Secondary Storage.- Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures.- Session 3. Probabilistic and Algebraic Techniques.- New Bounds for Motif Finding in Strong Instances.- Fingerprint Clustering with Bounded Number of Missing Values.- Tiling an Interval of the Discrete Line.- Common Substrings in Random Strings.- Session 4. Applications in Molecular Biology I.- On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem.- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms.- Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees.- An Improved Algorithm for the Macro-evolutionary Phylogeny Problem.- Session 5. String Matching I.- Property Matching and Weighted Matching.- Faster Two Dimensional Scaled Matching.- Session 6. Applications in Molecular Biology II.- Approximation of RNA Multiple Structural Alignment.- Finding Common RNA Pseudoknot Structures in Polynomial Time.- A Compact Mathematical Programming Formulation for DNA Motif Finding.- Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.- Session 7. Applications in MolecularBiology III.- An Algorithm for Sorting by Reciprocal Translocations.- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.- Session 8. Data Compression.- A Simpler Analysis of Burrows-Wheeler Based Compression.- Statistical Encoding of Succinct Data Structures.- Dynamic Entropy-Compressed Sequences and Full-Text Indexes.- Reducing the Space Requirement of LZ-Index.- Session 9. String Matching II.- Faster Algorithms for Computing Longest Common Increasing Subsequences.- New Algorithms for Text Fingerprinting.- Sublinear Algorithms for Parameterized Matching.- Approximate Matching in Weighted Sequences.- Session 10. Dynamic Programming.- Algorithms for Finding a Most Similar Subforest.- Efficient Algorithms for Regular Expression Constrained Sequence Alignment.- Large Scale Matching for Position Weight Matrices.