大葉大學圖書館 |

Combinatorial pattern matching[electronic resource] :26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015 : proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	005.1
書名/作者:	Combinatorial pattern matching : 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015 : proceedings // edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro.
其他題名:	CPM 2015
其他作者:	Cicalese, Ferdinando.
團體作者:	Clark Conference
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	xix, 412 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Computer algorithms
標題:	Pattern recognition systems
標題:	Combinatorial analysis
標題:	Computer Science.
標題:	Pattern Recognition.
標題:	Algorithm Analysis and Problem Complexity.
標題:	Numeric Computing.
標題:	Discrete Mathematics in Computer Science.
標題:	Data Structures.
標題:	Computational Biology/Bioinformatics.
ISBN:	9783319199290 (electronic bk.)
ISBN:	9783319199283 (paper)
內容註:	On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling -- A Framework for Space-Efficient String Kernels -- Composite Repetition-Aware Data Structures -- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis -- Longest Common Extensions in Trees -- Longest Common Extensions in Sublinear Space -- Ranked Document Retrieval with Forbidden Pattern -- Parameterized Complexity of Superstring Problems -- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem -- Fast String Dictionary Lookup with One Error -- On the Readability of Overlap Digraphs -- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem -- Range Minimum Query Indexes in Higher Dimensions -- Alphabet-Dependent String Searching with Wexponential Search Trees -- Lempel Ziv Computation in Small Space (LZ-CISS) -- Succinct Non-overlapping Indexing -- Encodings of Range Maximum-Sum Segment Queries and Applications -- Compact Indexes for Flexible Top-k Retrieval -- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding -- Combinatorial RNA Design: Designability and Structure-Approximating Algorithm -- Dictionary Matching with Uneven Gaps -- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process -- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets -- String Powers in Trees -- Online Detection of Repetitions with Backtracking -- Greedy Conjecture for Strings of Length 4 -- Tighter Bounds for the Sum of Irreducible LCP Values -- Parallel External Memory Suffix Sorting -- On Maximal Unbordered Factors -- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree -- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints -- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm -- Encoding Nearest Larger Values -- Sorting by Cuts, Joins and Whole Chromosome Duplications.
摘要、提要註:	This book constitutes the refereed proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015, held on Ischia Island, Italy, in June/July 2015. The 34 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 83 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees; regular expressions; graphs; point sets; and arrays. The goal is to derive combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.
電子資源:	http://dx.doi.org/10.1007/978-3-319-19929-0

Combinatorial pattern matching[electronic resource] :26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015 : proceedings /
Combinatorial pattern matching26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015 : proceedings /[electronic resource] :CPM 2015edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro. - Cham :Springer International Publishing :2015. - xix, 412 p. :ill., digital ;24 cm. - Lecture notes in computer science,91330302-9743 ;. - Lecture notes in computer science ;7103..

On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling -- A Framework for Space-Efficient String Kernels -- Composite Repetition-Aware Data Structures -- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis -- Longest Common Extensions in Trees -- Longest Common Extensions in Sublinear Space -- Ranked Document Retrieval with Forbidden Pattern -- Parameterized Complexity of Superstring Problems -- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem -- Fast String Dictionary Lookup with One Error -- On the Readability of Overlap Digraphs -- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem -- Range Minimum Query Indexes in Higher Dimensions -- Alphabet-Dependent String Searching with Wexponential Search Trees -- Lempel Ziv Computation in Small Space (LZ-CISS) -- Succinct Non-overlapping Indexing -- Encodings of Range Maximum-Sum Segment Queries and Applications -- Compact Indexes for Flexible Top-k Retrieval -- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding -- Combinatorial RNA Design: Designability and Structure-Approximating Algorithm -- Dictionary Matching with Uneven Gaps -- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process -- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets -- String Powers in Trees -- Online Detection of Repetitions with Backtracking -- Greedy Conjecture for Strings of Length 4 -- Tighter Bounds for the Sum of Irreducible LCP Values -- Parallel External Memory Suffix Sorting -- On Maximal Unbordered Factors -- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree -- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints -- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm -- Encoding Nearest Larger Values -- Sorting by Cuts, Joins and Whole Chromosome Duplications.

This book constitutes the refereed proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015, held on Ischia Island, Italy, in June/July 2015. The 34 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 83 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees; regular expressions; graphs; point sets; and arrays. The goal is to derive combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.

ISBN: 9783319199290 (electronic bk.)

Standard No.: 10.1007/978-3-319-19929-0doiSubjects--Topical Terms:

154731
Computer algorithms

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Combinatorial pattern matching[electronic resource] :26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015 : proceedings /
LDR:04007nam a2200337 a 4500 001 439295
003 DE-He213
005 20160119111817.0
006 m d
007 cr nn 008maaau
008 160322s2015 gw s 0 eng d
020 $a 9783319199290 (electronic bk.)
020 $a 9783319199283 (paper)
024 7 $a 10.1007/978-3-319-19929-0 $2 doi
035 $a 978-3-319-19929-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UYQP $2 bicssc
072 7 $a COM016000 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b C882 2015
111 2 $a Clark Conference $d (2005 : $c Sterling and Francine Clark Art Institute) $3 347558
245 1 0 $a Combinatorial pattern matching $h [electronic resource] : $b 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015 : proceedings / $c edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro.
246 3 $a CPM 2015
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xix, 412 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9133
505 0 $a On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling -- A Framework for Space-Efficient String Kernels -- Composite Repetition-Aware Data Structures -- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis -- Longest Common Extensions in Trees -- Longest Common Extensions in Sublinear Space -- Ranked Document Retrieval with Forbidden Pattern -- Parameterized Complexity of Superstring Problems -- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem -- Fast String Dictionary Lookup with One Error -- On the Readability of Overlap Digraphs -- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem -- Range Minimum Query Indexes in Higher Dimensions -- Alphabet-Dependent String Searching with Wexponential Search Trees -- Lempel Ziv Computation in Small Space (LZ-CISS) -- Succinct Non-overlapping Indexing -- Encodings of Range Maximum-Sum Segment Queries and Applications -- Compact Indexes for Flexible Top-k Retrieval -- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding -- Combinatorial RNA Design: Designability and Structure-Approximating Algorithm -- Dictionary Matching with Uneven Gaps -- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process -- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets -- String Powers in Trees -- Online Detection of Repetitions with Backtracking -- Greedy Conjecture for Strings of Length 4 -- Tighter Bounds for the Sum of Irreducible LCP Values -- Parallel External Memory Suffix Sorting -- On Maximal Unbordered Factors -- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree -- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints -- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm -- Encoding Nearest Larger Values -- Sorting by Cuts, Joins and Whole Chromosome Duplications.
520 $a This book constitutes the refereed proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015, held on Ischia Island, Italy, in June/July 2015. The 34 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 83 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees; regular expressions; graphs; point sets; and arrays. The goal is to derive combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.
650 0 $a Computer algorithms $3 154731
650 0 $a Pattern recognition systems $3 135230
650 0 $a Combinatorial analysis $3 136046
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Pattern Recognition. $3 463916
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Numeric Computing. $3 466954
650 2 4 $a Discrete Mathematics in Computer Science. $3 464912
650 2 4 $a Data Structures. $3 467911
650 2 4 $a Computational Biology/Bioinformatics. $3 463480
700 1 $a Cicalese, Ferdinando. $3 627076
700 1 $a Porat, Ely. $3 627077
700 1 $a Vaccaro, Ugo. $3 627078
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-19929-0
950 $a Computer Science (Springer-11645)