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… mais…
Springer.com Nr. 978-3-540-69066-5. Custos de envio:Worldwide free shipping, , DE. (EUR 0.00) Details... |
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - novo libro
2008, ISBN: 3540690662
2008 Kartoniert / Broschiert Kombinatorik, Pattern (EDV), Biowissenschaften, allgemein, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Data Mining, Nat… mais…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Custos de envio:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - livro usado
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… mais…
booklooker.de |
2008, ISBN: 3540690662
[EAN: 9783540690665], Neubuch, [PU: Springer], pp. 340, Books
AbeBooks.de Books Puddle, New York, NY, U.S.A. [70780988] [Rating: 4 (von 5)] NEW BOOK. Custos de envio: EUR 8.01 Details... |
ISBN: 9783540690665
Springer , pp. 340 . Papeback. New., Springer, 6
Biblio.co.uk |
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… mais…
Landau, Gad M. (Herausgeber); Ferragina, Paolo (Herausgeber):
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - novo libro2008, ISBN: 3540690662
2008 Kartoniert / Broschiert Kombinatorik, Pattern (EDV), Biowissenschaften, allgemein, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Data Mining, Nat… mais…
Combinatorial Pattern Matching 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings - livro usado
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… mais…
2008, ISBN: 3540690662
[EAN: 9783540690665], Neubuch, [PU: Springer], pp. 340, Books
no/na Biblio.co.uk
ISBN: 9783540690665
Springer , pp. 340 . Papeback. New., Springer, 6
Dados bibliográficos do melhor livro correspondente
Autor: | |
Título: | |
Número ISBN: |
Dados detalhados do livro - Combinatorial Pattern Matching
EAN (ISBN-13): 9783540690665
ISBN (ISBN-10): 3540690662
Livro de capa dura
Livro de bolso
Ano de publicação: 2008
Editor/Editora: Springer Berlin
317 Páginas
Peso: 0,514 kg
Língua: eng/Englisch
Livro na base de dados desde 2008-05-31T00:41:14+01:00 (Lisbon)
Página de detalhes modificada pela última vez em 2024-01-10T10:55:09+00:00 (Lisbon)
Número ISBN/EAN: 9783540690665
Número ISBN - Ortografia alternativa:
3-540-69066-2, 978-3-540-69066-5
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: torsten becker, landau, gad, paolo ferragina, daniel munro
Título do livro: italy, match, combinatorial pattern matching, symposium, june, 19th annual lecture, pisa, pat mat, theoretical, cpm, paolo
Dados da editora
Autor: Paolo Ferragina; Gad M. Landau
Título: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings
Editora: Springer; Springer Berlin
317 Páginas
Ano de publicação: 2008-06-03
Berlin; Heidelberg; DE
Língua: Inglês
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.Outros livros adicionais, que poderiam ser muito similares com este livro:
Último livro semelhante:
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)
< Para arquivar...