| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNIPARTHENOPE000033205 |
|
|
Autore |
Barozzi, Giulio Cesare |
|
|
Titolo |
Matematica per l'ingegneria dell'informazione / Giulio Cesare Barozzi |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Bologna, : Zanichelli, 2004 |
|
|
|
|
|
|
|
Titolo uniforme |
Matematica per l'ingegneria dell'informazione |
|
|
|
|
|
ISBN |
|
88-08-12546-7 |
978-88-08-12546-0 |
|
|
|
|
|
|
|
|
Edizione |
[Ristampa aggiornata] |
|
|
|
|
|
Descrizione fisica |
|
VII, 372 p. ; 27 cm + 1 CD-ROM. |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Collocazione |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910746292503321 |
|
|
Autore |
Nardini Franco Maria |
|
|
Titolo |
String Processing and Information Retrieval : 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer, , 2023 |
|
©2023 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (409 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science Series ; ; v.14240 |
|
|
|
|
|
|
Altri autori (Persone) |
|
PisantiNadia |
VenturiniRossano |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Text processing (Computer science) |
Information retrieval |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Preface -- Organization -- Abstracts of Invited Talks -- Information Retrieval Needs More Theoreticians -- Regular Expression Matching -- Recent Results on the Longest Common Substring Problem -- Contents -- Longest Common Prefix Arrays for Succinct k-Spectra -- 1 Introduction -- 2 Preliminaries -- 3 Basic O(nk)-Time LCS Array Construction -- 4 Faster Construction via Super-Alphabet Techniques -- 5 Construction in Linear Time -- 5.1 Correctness -- 6 Experimental Evaluation -- 7 Concluding Remarks -- References -- On Suffix Tree Detection -- 1 Introduction -- 2 Preliminaries -- 3 Periodic Strings Suffix Tree Detection -- 4 Necessary Conditions on a Binary String Suffix Tree -- 5 Conclusion and Open Problems -- References -- Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph -- 1 Introduction -- 2 Preliminaries -- 3 Techniques -- 4 Computing Run-Length BWT -- 5 Computing Irreducible GLPF Arrays |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book comprises the proceedings of the 30th International Symposium on String Processing and Information Retrieval (SPIRE 2023), held in Pisa, Italy. It includes peer-reviewed papers presented at |
|
|
|
|
|
|
|
|
|
|
the symposium, covering topics such as string processing, information retrieval, and computational biology. The symposium featured invited talks from prominent researchers and aimed to foster high-quality research at the intersection of these fields. |
|
|
|
|
|
| |