컨텐츠로 이동
Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings

저자: Johannes Fischer; Peter Sanders
출판사: Berlin ; New York : Springer, ©2013.
시리즈: Lecture notes in computer science, 7922.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
판/형식:   전자도서 : 문서 : 컨퍼런스 간행물 : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:
This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees,  더 읽기…
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

온라인으로 문서 찾기

이 항목에 대한 링크

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

장르/형태: Electronic books
Conference proceedings
Congresses
자료 유형: 컨퍼런스 간행물, 문서, 인터넷 자료
문서 형식: 인터넷 자원, 컴퓨터 파일
모든 저자 / 참여자: Johannes Fischer; Peter Sanders
ISBN: 9783642389054 3642389058 364238904X 9783642389047
OCLC 번호: 845035920
메모: International conference proceedings.
Includes author index.
설명: 1 online resource (x, 258 pages) : illustrations
내용: Forty Years of Text Indexing / Alberto Apostolico, Maxime Crochemore --
LCP Magic / Moshe Lewenstein --
Discrete Methods for Image Analysis Applied to Molecular Biology / Gene Myers --
Locating All Maximal Approximate Runs in a String / Mika Amit, Maxime Crochemore, Gad M. Landau --
On Minimal and Maximal Suffixes of a Substring / Maxim Babenko, Ignat Kolesnichenko, Tatiana Starikovskaya --
Converting SLP to LZ78 in almost Linear Time / Hideo Bannai, Paweł Gawrychowski, Shunsuke Inenaga --
A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm / Gary Benson, Yozen Hernandez, Joshua Loving --
Compact q-Gram Profiling of Compressed Strings / Philip Bille, Patrick Hagge Cording, Inge Li Gørtz --
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform / Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen --
Pattern Matching with Variables: A Multivariate Complexity Analysis / Henning Fernau, Markus L. Schmid --
New Algorithms for Position Heaps / Travis Gagie, Wing-Kai Hon, Tsung-Han Ku --
Document Listing on Repetitive Collections / Travis Gagie, Kalle Karhu, Gonzalo Navarro --
Approximating Shortest Superstring Problem Using de Bruijn Graphs / Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin --
Local Search for String Problems: Brute Force Is Essentially Optimal / Jiong Guo, Danny Hermelin, Christian Komusiewicz --
Space-Efficient Construction Algorithm for the Circular Suffix Tree / Wing-Kai Hon, Tsung-Han Ku, Rahul Shah --
Efficient Lyndon Factorization of Grammar Compressed Text / Tomohiro I, Yuto Nakashima, Shunsuke Inenaga --
Approximation of Grammar-Based Compression via Recompression / Artur Jeż --
Fast Algorithm for Partial Covers in Words / Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski --
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small / Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi --
External Memory Generalized Suffix and LCP Arrays Construction / Felipe A. Louza, Guilherme P. Telles --
Efficient All Path Score Computations on Grid Graphs / Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson --
Time-Space Trade-Offs for the Longest Common Substring Problem / Tatiana Starikovskaya, Hjalte Wedel Vildhøj --
A Succinct Grammar Compression / Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto --
Data Structure Lower Bounds on Random 7Access to Grammar-Compressed Strings / Elad Verbin, Wei Yu.
일련 제목: Lecture notes in computer science, 7922.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
다른 제목 CPM 2013
책임: Johannes Fischer, Peter Sanders (eds.).
더 많은 정보:

초록:

This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 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 non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problem or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.

리뷰

사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


<http://www.worldcat.org/oclc/845035920>
library:oclcnum"845035920"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/845035920>
rdf:typeschema:Book
schema:about
<http://id.worldcat.org/fast/868961>
rdf:typeschema:Intangible
schema:name"Combinatorial analysis"@en
schema:name"Combinatorial analysis."@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:copyrightYear"2013"
schema:creator
schema:datePublished"2013"
schema:description"This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 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 non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problem or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1348813812>
schema:genre"Conference proceedings."@en
schema:genre"Electronic books."@en
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:name"CPM 2013"@en
schema:name"Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings"@en
schema:publisher
schema:url
schema:url<http://dx.doi.org/10.1007/978-3-642-38905-4>
schema:workExample
schema:workExample

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.