000 06257nam a22006375i 4500
001 978-3-540-73437-6
003 DE-He213
005 20240730183258.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540734376
_9978-3-540-73437-6
024 7 _a10.1007/978-3-540-73437-6
_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] :
_b18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings /
_cedited by Bin Ma, Kaizhong Zhang.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXII, 368 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 ;
_v4580
505 0 _aInvited Talks (Abstracts) -- A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search -- Stringology: Some Classic and Some Modern Problems -- Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors -- Session 1: Alogirthmic Techniques I -- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions -- On Demand String Sorting over Unbounded Alphabets -- Session 2: Approximate Pattern Matching -- Finding Witnesses by Peeling -- Cache-Oblivious Index for Approximate String Matching -- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts -- Self-normalised Distance with Don't Cares -- Session 3: Data Compression I -- Move-to-Front, Distance Coding, and Inversion Frequencies Revisited -- A Lempel-Ziv Text Index on Secondary Storage -- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts -- Most Burrows-Wheeler Based Compressors Are Not Optimal -- Session 4: Computational Biology I -- Non-breaking Similarity of Genomes with Gene Repetitions -- A New and Faster Method of Sorting by Transpositions -- Finding Compact Structural Motifs -- Session 5: Computational Biology II -- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants -- Computing Exact p-Value for Structured Motif -- Session 6: Algorithmic Techniques II -- Improved Sketching of Hamming Distance with Error Correcting -- Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications -- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge -- Space-Efficient Algorithms for Document Retrieval -- Session 7: Data Compression II -- Compressed Text Indexes with Fast Locate -- Processing Compressed Texts: A Tractability Border -- Session 8:Computational Biology III -- Common Structured Patterns in Linear Graphs: Approximation and Combinatorics -- Identification of Distinguishing Motifs -- Algorithms for Computing the Longest Parameterized Common Subsequence -- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem -- Session 9: Pattern Analysis -- Two-Dimensional Range Minimum Queries -- Tiling Periodicity -- Fast and Practical Algorithms for Computing All the Runs in a String -- Longest Common Separable Pattern Among Permutations -- Session 10: Suffix Arrays and Trees -- Suffix Arrays on Words -- Efficient Computation of Substring Equivalence Classes with Suffix Arrays -- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.
520 _aThe papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees, and computational biology. They were selected from 64 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 32 papers. The p- gramme also included three invited talks by Tao Jiang from the University of California, Riverside, USA, S. Muthukrishnan from Rutgers University, USA, and Frances Yao from City University of Hong Kong, Hong Kong. Combinatorial Pattern Matching addresses issues of searching and matching stringsandmorecomplicatedpatternssuchastrees,regularexpressions,graphs, point sets, and arrays.The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed e?ciently.
650 0 _aPattern recognition systems.
_93953
650 0 _aAlgorithms.
_93390
650 0 _aNatural language processing (Computer science).
_94741
650 0 _aData mining.
_93907
650 0 _aBioinformatics.
_99561
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aAutomated Pattern Recognition.
_931568
650 2 4 _aAlgorithms.
_93390
650 2 4 _aNatural Language Processing (NLP).
_931587
650 2 4 _aData Mining and Knowledge Discovery.
_9131300
650 2 4 _aComputational and Systems Biology.
_931619
650 2 4 _aData Science.
_934092
700 1 _aMa, Bin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9131301
700 1 _aZhang, Kaizhong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9131302
710 2 _aSpringerLink (Online service)
_9131303
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540734369
776 0 8 _iPrinted edition:
_z9783540840459
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4580
_9131304
856 4 0 _uhttps://doi.org/10.1007/978-3-540-73437-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91776
_d91776