2008, ISBN: 9783540690665
The papers contained in this volume were presented at the 19th Annual S- posium on Combinatorial Pattern Matching (CPM 2008) held at the University of Pisa, Italy, June 18–20, 2008. All t… Plus…
Springer.com Nr. 978-3-540-69066-5. Frais d'envoiWorldwide free shipping, , DE. (EUR 0.00) Details... |
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - nouveau livre
2008, ISBN: 3540690662
2008 Kartoniert / Broschiert Kombinatorik, Pattern (EDV), Biowissenschaften, allgemein, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Data Mining, Nat… Plus…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
2008, ISBN: 9783540690665
*Combinatorial Pattern Matching* - 19th Annual Symposium CPM 2008 Pisa Italy June 18-20 2008 Proceedings. Auflage 2008 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Ratgeber, Compu… Plus…
Hugendubel.de Frais d'envoiShipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - livre d'occasion
2008, ISBN: 9783540690665
[PU: Springer Berlin], Neubindung, Buchumschlag leicht geknickt, Auflage 2008 4450582/12, DE, [SC: 0.00], gebraucht; sehr gut, gewerbliches Angebot, 2008, Banküberweisung, Kreditkarte, Pa… Plus…
booklooker.de |
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - livre d'occasion
2008, ISBN: 9783540690665
[PU: Springer Berlin], Neubindung, Buchumschlag leicht geknickt, Auflage 2008 4450582/12, DE, [SC: 0.00], gebraucht; sehr gut, gewerbliches Angebot, 2008, Banküberweisung, Kreditkarte, Pa… Plus…
booklooker.de |
2008, ISBN: 9783540690665
The papers contained in this volume were presented at the 19th Annual S- posium on Combinatorial Pattern Matching (CPM 2008) held at the University of Pisa, Italy, June 18–20, 2008. All t… Plus…
Landau, Gad M. (Herausgeber); Ferragina, Paolo (Herausgeber):
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - nouveau livre2008, ISBN: 3540690662
2008 Kartoniert / Broschiert Kombinatorik, Pattern (EDV), Biowissenschaften, allgemein, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Data Mining, Nat… Plus…
2008
ISBN: 9783540690665
*Combinatorial Pattern Matching* - 19th Annual Symposium CPM 2008 Pisa Italy June 18-20 2008 Proceedings. Auflage 2008 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Ratgeber, Compu… Plus…
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - livre d'occasion
2008, ISBN: 9783540690665
[PU: Springer Berlin], Neubindung, Buchumschlag leicht geknickt, Auflage 2008 4450582/12, DE, [SC: 0.00], gebraucht; sehr gut, gewerbliches Angebot, 2008, Banküberweisung, Kreditkarte, Pa… Plus…
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - livre d'occasion
2008, ISBN: 9783540690665
[PU: Springer Berlin], Neubindung, Buchumschlag leicht geknickt, Auflage 2008 4450582/12, DE, [SC: 0.00], gebraucht; sehr gut, gewerbliches Angebot, 2008, Banküberweisung, Kreditkarte, Pa… Plus…
Données bibliographiques du meilleur livre correspondant
Auteur: | |
Titre: | |
ISBN: |
Informations détaillées sur le livre - Combinatorial Pattern Matching
EAN (ISBN-13): 9783540690665
ISBN (ISBN-10): 3540690662
Version reliée
Livre de poche
Date de parution: 2008
Editeur: Springer Berlin Heidelberg
317 Pages
Poids: 0,514 kg
Langue: eng/Englisch
Livre dans la base de données depuis 2008-05-31T01:41:14+02:00 (Paris)
Page de détail modifiée en dernier sur 2024-04-15T14:32:29+02:00 (Paris)
ISBN/EAN: 3540690662
ISBN - Autres types d'écriture:
3-540-69066-2, 978-3-540-69066-5
Autres types d'écriture et termes associés:
Auteur du livre: torsten becker, landau, gad, paolo ferragina, daniel munro
Titre du livre: italy, match, combinatorial pattern matching, symposium, june, 19th annual lecture, pisa, pat mat, theoretical, cpm, paolo
Données de l'éditeur
Auteur: Paolo Ferragina; Gad M. Landau
Titre: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings
Editeur: Springer; Springer Berlin
317 Pages
Date de parution: 2008-06-03
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIII, 317 p.
BC; Hardcover, Softcover / Informatik, EDV/Anwendungs-Software; Mustererkennung; Verstehen; Pattern Matching; algorithm; algorithms; biology; data compression; data mining; databases; pattern recognition; algorithm analysis and problem complexity; Automated Pattern Recognition; Life Sciences; Programming Techniques; Algorithms; Natural Language Processing (NLP); Data Mining and Knowledge Discovery; Biowissenschaften, allgemein; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Natürliche Sprachen und maschinelle Übersetzung; Data Mining; Wissensbasierte Systeme, Expertensysteme; EA
Invited Talks.- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations.- Lower Bounds for Succinct Data Structures.- The Changing Face of Web Search.- Contributed Papers.- Two-Dimensional Pattern Matching with Combined Scaling and Rotation.- Searching for Gapped Palindromes.- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.- Finding Largest Well-Predicted Subset of Protein Structure Models.- HP Distance Via Double Cut and Join Distance.- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots.- Faster Algorithm for the Set Variant of the String Barcoding Problem.- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics.- Analysis of the Size of Antidictionary in DCA.- Approximate String Matching with Address Bit Errors.- On-Line Approximate String Matching with Bounded Errors.- A Black Box for Online Approximate Pattern Matching.- An(other) Entropy-Bounded Compressed Suffix Tree.- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices.- Computing Inverse ST in Linear Complexity.- Dynamic Fully-Compressed Suffix Trees.- A Linear Delay Algorithm for Building Concept Lattices.- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares.- Fast Algorithms for Computing Tree LCS.- Why Greed Works for Shortest Common Superstring Problem.- Constrained LCS: Hardness and Approximation.- Finding Additive Biclusters with Random Background.- An Improved Succinct Representation for Dynamic k-ary Trees.- Towards a Solution to the “Runs” Conjecture.- On the Longest Common Parameterized Subsequence.Autres livres qui pourraient ressembler au livre recherché:
Dernier livre similaire:
9783540690689 Combinatorial Pattern Matching (Paolo Ferragina; Gad M. Landau)
- 9783540690689 Combinatorial Pattern Matching (Paolo Ferragina; Gad M. Landau)
- 9783642214585 Combinatorial Pattern Matching (Raffaele Giancarlo; Giovanni Manzini)
- 9783642135095 Combinatorial Pattern Matching (Amihood Amir; Laxmi Parida)
- 9783319075655 Combinatorial Pattern Matching: 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings Alexander S. Kulikov Editor (Alexander S. Kulikov)
< pour archiver...