String Processing and Information Retrieval 14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Ziviani, Nivio (Επιμελητής έκδοσης), Baeza-Yates, Ricardo (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Σειρά:Lecture Notes in Computer Science, 4726
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03488nam a22005655i 4500
001 978-3-540-75530-2
003 DE-He213
005 20151204142016.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540755302  |9 978-3-540-75530-2 
024 7 |a 10.1007/978-3-540-75530-2  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.D35 
072 7 |a UMB  |2 bicssc 
072 7 |a URY  |2 bicssc 
072 7 |a COM031000  |2 bisacsh 
082 0 4 |a 005.74  |2 23 
245 1 0 |a String Processing and Information Retrieval  |h [electronic resource] :  |b 14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings /  |c edited by Nivio Ziviani, Ricardo Baeza-Yates. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2007. 
300 |a XII, 311 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4726 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Data structures (Computer science). 
650 0 |a Coding theory. 
650 0 |a Database management. 
650 0 |a Data mining. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Data Structures, Cryptology and Information Theory. 
650 2 4 |a Data Mining and Knowledge Discovery. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Database Management. 
650 2 4 |a Data Structures. 
650 2 4 |a Coding and Information Theory. 
700 1 |a Ziviani, Nivio.  |e editor. 
700 1 |a Baeza-Yates, Ricardo.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540755296 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4726 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-75530-2  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)