000 04364nam a22006135i 4500
001 978-3-642-02441-2
003 DE-He213
005 20240730194219.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642024412
_9978-3-642-02441-2
024 7 _a10.1007/978-3-642-02441-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCombinatorial Pattern Matching
_h[electronic resource] :
_b20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings /
_cedited by Gregory Kucherov, Esko Ukkonen.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXIII, 370 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5577
505 0 _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 HaplotypeData -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
650 0 _aComputer science.
_99832
650 0 _aPattern recognition systems.
_93953
650 0 _aBioinformatics.
_99561
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aInformation storage and retrieval systems.
_922213
650 1 4 _aTheory of Computation.
_9156172
650 2 4 _aAutomated Pattern Recognition.
_931568
650 2 4 _aComputational and Systems Biology.
_931619
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aInformation Storage and Retrieval.
_923927
700 1 _aKucherov, Gregory.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156173
700 1 _aUkkonen, Esko.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156174
710 2 _aSpringerLink (Online service)
_9156175
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642024405
776 0 8 _iPrinted edition:
_z9783642024429
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5577
_9156176
856 4 0 _uhttps://doi.org/10.1007/978-3-642-02441-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95085
_d95085