LEADER 03885nam 2200601Ia 450 001 9910483950803321 005 20200520144314.0 010 $a3-642-02441-6 024 7 $a10.1007/978-3-642-02441-2 035 $a(CKB)1000000000761222 035 $a(SSID)ssj0000316694 035 $a(PQKBManifestationID)11258543 035 $a(PQKBTitleCode)TC0000316694 035 $a(PQKBWorkID)10275019 035 $a(PQKB)10809819 035 $a(DE-He213)978-3-642-02441-2 035 $a(MiAaPQ)EBC3064303 035 $a(PPN)136306853 035 $a(EXLCZ)991000000000761222 100 $a20040702d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aCombinatorial pattern matching $e20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings /$fGregory Kucherov, Esko Ukkonen (eds.) 205 $a1st ed. 2009. 210 $aBerlin ;$aNew York $cSpringer$dc2009 215 $a1 online resource (XIII, 370 p.) 225 1 $aLecture notes in computer science ;$v5577 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-02440-8 320 $aIncludes bibliographical references and index. 327 $aCPM?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). 410 0$aLecture notes in computer science ;$v5577. 517 3 $aCPM 2004 606 $aComputer algorithms$vCongresses 606 $aCombinatorial analysis$vCongresses 615 0$aComputer algorithms 615 0$aCombinatorial analysis 676 $a004.0151 686 $aDAT 537f$2stub 686 $aSS 4800$2rvk 701 $aKucherov$b Gregory$01760411 701 $aUkkonen$b E$g(Esko),$f1950-$01760412 712 12$aSymposium on Combinatorial Pattern Matching 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483950803321 996 $aCombinatorial pattern matching$94199373 997 $aUNINA