000			04016nam a22005655i 4500
001			978-3-642-02441-2
003			DE-He213
005			20160624102130.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	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _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.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _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		_aLecture Notes in Computer Science, _x0302-9743 ; _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 Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
650		0	_aComputer science.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aInformation storage and retrieval systems.
650		0	_aOptical pattern recognition.
650		0	_aBioinformatics.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aData Structures.
650	2	4	_aInformation Storage and Retrieval.
650	2	4	_aPattern Recognition.
650	2	4	_aComputational Biology/Bioinformatics.
650	2	4	_aBioinformatics.
700	1		_aKucherov, Gregory. _eeditor.
700	1		_aUkkonen, Esko. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642024405
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v5577
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-02441-2
942			_2EBK8554 _cEBK
999			_c37848 _d37848