pular para conteúdo
Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings Ver prévia deste item
FecharVer prévia deste item
Checando...

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

Autor: Johannes Fischer; Peter Sanders
Editora: Berlin ; New York : Springer, ©2013.
Séries: Lecture notes in computer science, 7922.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Edição/Formato   e-book : Documento : Publicação de conferência : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Resumo:
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,  Ler mais...
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia on-line

Links para este item

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Gênero/Forma: Electronic books
Conference proceedings
Congresses
Tipo de Material: Publicação de conferência, Documento, Recurso Internet
Tipo de Documento: Recurso Internet, Arquivo de Computador
Todos os Autores / Contribuintes: Johannes Fischer; Peter Sanders
ISBN: 9783642389054 3642389058 364238904X 9783642389047
Número OCLC: 845035920
Notas: International conference proceedings.
Includes author index.
Descrição: 1 online resource (x, 258 pages) : illustrations
Conteúdos: 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.
Título da Série: Lecture notes in computer science, 7922.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Outros Títulos: CPM 2013
Responsabilidade: Johannes Fischer, Peter Sanders (eds.).
Mais informações:

Resumo:

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.

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.
Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


<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
umbel:isLike<http://bnb.data.bl.uk/id/resource/GBB358261>

Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.