000 04430nam a22005895i 4500
001 978-3-540-69068-9
003 DE-He213
005 20160624102053.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540690689
_9978-3-540-69068-9
024 7 _a10.1007/978-3-540-69068-9
_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] :
_b19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 Proceedings /
_cedited by Paolo Ferragina, Gad M. Landau.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _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 ;
_v5029
505 0 _aInvited Talks -- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations -- Lower Bounds for Succinct Data Structures -- The Changing Face of Web Search -- Contributed Papers -- Two-Dimensional Pattern Matching with Combined Scaling and Rotation -- Searching for Gapped Palindromes -- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems -- Finding Largest Well-Predicted Subset of Protein Structure Models -- HP Distance Via Double Cut and Join Distance -- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots -- Faster Algorithm for the Set Variant of the String Barcoding Problem -- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics -- Analysis of the Size of Antidictionary in DCA -- Approximate String Matching with Address Bit Errors -- On-Line Approximate String Matching with Bounded Errors -- A Black Box for Online Approximate Pattern Matching -- An(other) Entropy-Bounded Compressed Suffix Tree -- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices -- Computing Inverse ST in Linear Complexity -- Dynamic Fully-Compressed Suffix Trees -- A Linear Delay Algorithm for Building Concept Lattices -- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares -- Fast Algorithms for Computing Tree LCS -- Why Greed Works for Shortest Common Superstring Problem -- Constrained LCS: Hardness and Approximation -- Finding Additive Biclusters with Random Background -- An Improved Succinct Representation for Dynamic k-ary Trees -- Towards a Solution to the “Runs” Conjecture -- On the Longest Common Parameterized Subsequence.
520 _aThis book constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008. The 25 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 78 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aData mining.
650 0 _aText processing (Computer science.
650 0 _aOptical pattern recognition.
650 0 _aBioinformatics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aPattern Recognition.
650 2 4 _aDocument Preparation and Text Processing.
650 2 4 _aData Mining and Knowledge Discovery.
650 2 4 _aComputational Biology/Bioinformatics.
650 2 4 _aData Structures.
700 1 _aFerragina, Paolo.
_eeditor.
700 1 _aLandau, Gad M.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540690665
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5029
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-69068-9
942 _2EBK7118
_cEBK
999 _c36412
_d36412