04792nam 22007935 450 99646584350331620230406061951.03-642-02441-610.1007/978-3-642-02441-2(CKB)1000000000761222(SSID)ssj0000316694(PQKBManifestationID)11258543(PQKBTitleCode)TC0000316694(PQKBWorkID)10275019(PQKB)10809819(DE-He213)978-3-642-02441-2(MiAaPQ)EBC3064303(PPN)136306853(EXLCZ)99100000000076122220100301d2009 u| 0engurnn|008mamaatxtccrCombinatorial Pattern Matching[electronic resource] 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings /edited by Gregory Kucherov, Esko Ukkonen1st ed. 2009.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2009.1 online resource (XIII, 370 p.) Theoretical Computer Science and General Issues,2512-2029 ;5577Bibliographic Level Mode of Issuance: Monograph3-642-02440-8 Includes bibliographical references and index.CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).Theoretical Computer Science and General Issues,2512-2029 ;5577Computer sciencePattern recognition systemsBioinformaticsAlgorithmsArtificial intelligence—Data processingInformation storage and retrieval systemsTheory of ComputationAutomated Pattern RecognitionComputational and Systems BiologyAlgorithmsData ScienceInformation Storage and RetrievalComputer science.Pattern recognition systems.Bioinformatics.Algorithms.Artificial intelligence—Data processing.Information storage and retrieval systems.Theory of Computation.Automated Pattern Recognition.Computational and Systems Biology.Algorithms.Data Science.Information Storage and Retrieval.004.0151DAT 537fstubSS 4800rvkKucherov Gregoryedthttp://id.loc.gov/vocabulary/relators/edtUkkonen Eskoedthttp://id.loc.gov/vocabulary/relators/edtSymposium on Combinatorial Pattern MatchingBOOK996465843503316Combinatorial Pattern Matching772744UNISA