doorgaan naar inhoud
Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

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

Auteur: Johannes Fischer; Peter Sanders
Uitgever: Berlin ; New York : Springer, ©2013.
Serie: Lecture notes in computer science, 7922.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Editie/Formaat:   eBoek : Document : Conferentie-uitgave : EngelsAlle edities en materiaalsoorten bekijken.
Database:WorldCat
Samenvatting:
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,  Meer lezen...
Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een online exemplaar

Links naar dit item

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Genre/Vorm: Electronic books
Conference proceedings
Congresses
Aanvullende fysieke materiaalsoort: Printed edition:
Genre: Conferentie-uitgave, Document, Internetbron
Soort document: Internetbron, Computerbestand
Alle auteurs / medewerkers: Johannes Fischer; Peter Sanders
ISBN: 9783642389054 3642389058 364238904X 9783642389047
OCLC-nummer: 845035920
Opmerkingen: International conference proceedings.
Includes author index.
Beschrijving: 1 online resource (x, 258 pages) : illustrations
Inhoud: 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.
Serietitel: Lecture notes in computer science, 7922.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Andere titels: CPM 2013
Verantwoordelijkheid: Johannes Fischer, Peter Sanders (eds.).
Meer informatie:

Fragment:

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.

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.
Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde data


<http://www.worldcat.org/oclc/845035920>
library:oclcnum"845035920"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
rdf:typeschema:MediaObject
rdf:valueUnknown value: cnp
rdf:valueUnknown value: dct
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:alternateName"CPM 2013"@en
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"Electronic books"@en
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:isPartOf
schema:isPartOf
schema:name"Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings"@en
schema:publication
schema:publisher
schema:url
schema:workExample
schema:workExample
schema:workExample
umbel:isLike<http://bnb.data.bl.uk/id/resource/GBB358261>
wdrs:describedby

Content-negotiable representations

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.