LEADER 05936nam 22008295 450 001 9910484198003321 005 20251226202453.0 010 $a3-540-35461-1 024 7 $a10.1007/11780441 035 $a(CKB)1000000000233028 035 $a(SSID)ssj0000316696 035 $a(PQKBManifestationID)11261818 035 $a(PQKBTitleCode)TC0000316696 035 $a(PQKBWorkID)10276691 035 $a(PQKB)11420523 035 $a(DE-He213)978-3-540-35461-1 035 $a(MiAaPQ)EBC3068218 035 $a(PPN)123136083 035 $a(BIP)32372514 035 $a(BIP)13540242 035 $a(EXLCZ)991000000000233028 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching $e17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings /$fedited by Moshe Lewenstein, Gabriel Valiente 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XII, 420 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4009 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-35455-7 320 $aIncludes bibliographical references and index. 327 $aAsynchronous 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4009 606 $aPattern recognition systems 606 $aAlgorithms 606 $aNatural language processing (Computer science) 606 $aInformation storage and retrieval systems 606 $aBioinformatics 606 $aArtificial intelligence$xData processing 606 $aAutomated Pattern Recognition 606 $aAlgorithms 606 $aNatural Language Processing (NLP) 606 $aInformation Storage and Retrieval 606 $aBioinformatics 606 $aData Science 615 0$aPattern recognition systems. 615 0$aAlgorithms. 615 0$aNatural language processing (Computer science). 615 0$aInformation storage and retrieval systems. 615 0$aBioinformatics. 615 0$aArtificial intelligence$xData processing. 615 14$aAutomated Pattern Recognition. 615 24$aAlgorithms. 615 24$aNatural Language Processing (NLP). 615 24$aInformation Storage and Retrieval. 615 24$aBioinformatics. 615 24$aData Science. 676 $a006.4 701 $aLewenstein$b Moshe$01751467 701 $aValiente$b Gabriel$0150887 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484198003321 996 $aCombinatorial pattern matching$94186453 997 $aUNINA