| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISOBSOBE00028459 |
|
|
Autore |
Forte, Francesco |
|
|
Titolo |
2 / Francesco Forte |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Collana |
|
Piccola biblioteca Einaudi ; 41,2 |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
2. |
Record Nr. |
UNINA9910483963703321 |
|
|
Titolo |
String processing and information retrieval : 14th international symposium, SPIRE 2007, Santiago, Chile, October 29-31, 2007 : proceedings / / Nivio Ziviani, Ricardo Baeza-Yates (eds.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin ; ; New York, : Springer, c2007 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2007.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 311 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science, , 0302-9743 ; ; 4726 |
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
ZivianiNivio |
Baeza-YatesR (Ricardo) |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Text processing (Computer science) |
Information storage and retrieval systems |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences -- Edge-Guided Natural Language Text Compression -- Local Transpositions in Alignment of Polyphonic Musical Sequences -- Efficient Computations of ?1 and ???? |
|
|
|
|
|
|
|
|
|
|
Rearrangement Distances -- Generalized LCS -- Exploiting Genre in Focused Crawling -- Admission Policies for Caches of Search Engine Results -- A Pocket Guide to Web History -- Jump-Matching with Errors -- Estimating Number of Citations Using Author Reputation -- A Fast and Compact Web Graph Representation -- A Filtering Algorithm for k-Mismatch with Don’t Cares -- Compact Set Representation for Information Retrieval -- Approximate Swap and Mismatch Edit Distance -- Approximating Constrained LCS -- Tuning Approximate Boyer-Moore for Gene Sequences -- Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage -- Indexing a Dictionary for Subset Matching Queries -- Extending Weighting Models with a Term Quality Measure -- Highly Frequent Terms and Sentence Retrieval -- Implicit Compression Boosting with Applications to Self-indexing -- A Web-Page Usage Prediction Scheme Using Weighted Suffix Trees -- Enhancing Educational-Material Retrieval Using Authored-Lesson Metadata -- Approximate String Matching with Lempel-Ziv Compressed Indexes -- Algorithms for Weighted Matching -- Efficient Text Proximity Search -- Prefix-Shuffled Geometric Suffix Tree. |
|
|
|
|
|
| |