- 5 Risultati
prezzo più basso: € 31,21, prezzo più alto: € 55,60, prezzo medio: € 44,32
1
Combinatorial Pattern Matching
Ordina
da Springer.com
€ 53,49
Spedizione: € 0,001
Ordina
Dettagli del offerente
Link sponsorizzato

Combinatorial Pattern Matching - nuovo libro

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… Altro …

Nr. 978-3-540-69066-5. Costi di spedizione:Worldwide free shipping, , DE. (EUR 0.00)
Chiudere (X)
2
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - Landau, Gad M. (Herausgeber); Ferragina, Paolo (Herausgeber)
Ordina
da Achtung-Buecher.de
€ 55,60
Spedizione: € 0,001
Ordina
Dettagli del offerente
Link sponsorizzato

Landau, Gad M. (Herausgeber); Ferragina, Paolo (Herausgeber):

Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - nuovo libro

2008, ISBN: 3540690662

2008 Kartoniert / Broschiert Kombinatorik, Pattern (EDV), Biowissenschaften, allgemein, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Data Mining, Nat… Altro …

Costi di spedizione:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
Chiudere (X)
3
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - Ferragina, Paolo und Gad M. Landau
Ordina
da booklooker.de
€ 31,21
Spedizione: € 0,001
Ordina
Dettagli del offerente
Link sponsorizzato
Ferragina, Paolo und Gad M. Landau:
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - libri usati

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… Altro …

Costi di spedizione:Versandkostenfrei. (EUR 0.00) Buchpark GmbH
Chiudere (X)
4
Combinatorial Pattern Matching
Ordina
da AbeBooks.de
€ 43,52
Spedizione: € 8,011
Ordina
Dettagli del offerente
Link sponsorizzato
Combinatorial Pattern Matching - edizione con copertina flessibile

2008, ISBN: 3540690662

[EAN: 9783540690665], Neubuch, [PU: Springer], pp. 340, Books

NEW BOOK. Costi di spedizione: EUR 8.01 Books Puddle, New York, NY, U.S.A. [70780988] [Rating: 4 (von 5)]
Chiudere (X)
5
Ordina
da Biblio.co.uk
$ 42,40
(indicativi € 37,79)
Spedizione: € 16,041
Ordina
Dettagli del offerente
Link sponsorizzato
Combinatorial Pattern Matching - nuovo libro

ISBN: 9783540690665

Springer , pp. 340 . Papeback. New., Springer, 6

Costi di spedizione: EUR 16.04 Cold Books
Chiudere (X)
1Poiché alcune piattaforme non trasmettono le condizioni di spedizione e queste possono dipendere dal paese di consegna, dal prezzo di acquisto, dal peso e dalle dimensioni dell'articolo, dall'eventuale iscrizione alla piattaforma, dalla consegna diretta da parte della piattaforma o tramite un fornitore terzo (Marketplace), ecc. è possibile che le spese di spedizione indicate da eurolibro non corrispondano a quelle della piattaforma offerente.

Dati bibliografici del miglior libro corrispondente

Dettagli del libro
Combinatorial Pattern Matching
Autore:
Titolo:
ISBN:

9783540690665


This book constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008. The 25 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 78 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching.

Informazioni dettagliate del libro - Combinatorial Pattern Matching


EAN (ISBN-13): 9783540690665
ISBN (ISBN-10): 3540690662
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 2008
Editore: Springer Berlin
317 Pagine
Peso: 0,514 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2008-05-31T01:41:14+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2024-01-10T11:55:09+01:00 (Zurich)
ISBN/EAN: 9783540690665

ISBN - Stili di scrittura alternativi:
3-540-69066-2, 978-3-540-69066-5
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : torsten becker, landau, gad, paolo ferragina, daniel munro
Titolo del libro: italy, match, combinatorial pattern matching, symposium, june, 19th annual lecture, pisa, pat mat, theoretical, cpm, paolo

Dati dell'editore

Autore: Paolo Ferragina; Gad M. Landau
Titolo: 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
Editore: Springer; Springer Berlin
317 Pagine
Anno di pubblicazione: 2008-06-03
Berlin; Heidelberg; DE
Lingua: Inglese
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.
< Per archiviare...