000 04260nam a22006255i 4500
001 978-3-642-13509-5
003 DE-He213
005 20240730194214.0
007 cr nn 008mamaa
008 100625s2010 gw | s |||| 0|eng d
020 _a9783642135095
_9978-3-642-13509-5
024 7 _a10.1007/978-3-642-13509-5
_2doi
050 4 _aQ337.5
050 4 _aTK7882.P3
072 7 _aUYQP
_2bicssc
072 7 _aCOM016000
_2bisacsh
072 7 _aUYQP
_2thema
082 0 4 _a006.4
_223
245 1 0 _aCombinatorial Pattern Matching
_h[electronic resource] :
_b21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings, /
_cedited by Amihood Amir, Laxmi Parida.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXIII, 362 p. 84 illus.
_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 ;
_v6129
505 0 _aAlgorithms for Forest Pattern Matching -- Affine Image Matching Is Uniform -Complete -- Old and New in Stringology -- Small-Space 2D Compressed Dictionary Matching -- Bidirectional Search in a String with Wavelet Trees -- A Minimal Periods Algorithm with Applications -- The Property Suffix Tree with Dynamic Properties -- Approximate All-Pairs Suffix/Prefix Overlaps -- Succinct Dictionary Matching with No Slowdown -- Pseudo-realtime Pattern Matching: Closing the Gap -- Breakpoint Distance and PQ-Trees -- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs -- Succinct Representations of Separable Graphs -- Implicit Hitting Set Problems and Multi-genome Alignment -- Bounds on the Minimum Mosaic of Population Sequences under Recombination -- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection -- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints -- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks -- Mod/Resc Parsimony Inference -- Extended Islands of Tractability for Parsimony Haplotyping -- Sampled Longest Common Prefix Array -- Verifying a Parameterized Border Array in O(n 1.5) Time -- Cover Array String Reconstruction -- Compression, Indexing, and Retrieval for Massive String Data -- Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality -- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach -- Algorithms for Three Versions of the Shortest Common Superstring Problem -- Finding Optimal Alignment and Consensus of Circular Strings -- Optimizing Restriction Site Placement for Synthetic Genomes -- Extension and Faster Implementation of the GRP Transform for Lossless Compression -- Parallel andDistributed Compressed Indexes.
650 0 _aPattern recognition systems.
_93953
650 0 _aLife sciences.
_9156136
650 0 _aComputer programming.
_94169
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aData mining.
_93907
650 1 4 _aAutomated Pattern Recognition.
_931568
650 2 4 _aLife Sciences.
_9156137
650 2 4 _aProgramming Techniques.
_9156138
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aData Mining and Knowledge Discovery.
_9156139
700 1 _aAmir, Amihood.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156140
700 1 _aParida, Laxmi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156141
710 2 _aSpringerLink (Online service)
_9156142
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642135088
776 0 8 _iPrinted edition:
_z9783642135101
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6129
_9156143
856 4 0 _uhttps://doi.org/10.1007/978-3-642-13509-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95080
_d95080