000 03997nam a22003855i 4500
001 298193
003 MX-SnUAN
005 20160429155453.0
007 cr nn 008mamaa
008 150903s2007 gw | o |||| 0|eng d
020 _a9783540755302
_99783540755302
024 7 _a10.1007/9783540755302
_2doi
035 _avtls000351105
039 9 _a201509030503
_bVLOAD
_c201405060245
_dVLOAD
_y201402171113
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.D343
100 1 _aZiviani, Nivio.
_eeditor.
_9334408
245 1 0 _aString Processing and Information Retrieval :
_b14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings /
_cedited by Nivio Ziviani, Ricardo Baeza-Yates.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2007.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4726
500 _aSpringer eBooks
505 0 _aA 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.
520 _aThis book constitutes the refereed proceedings of the 14th International Symposium on String Processing and Information Retrieval, SPIRE 2007, held in Santiago, Chile, October 29-31, 2007. The 27 revised full papers presented were carefully reviewed and selected from 77 submissions. The papers topics span dictionary algorithms, text searching, pattern matching, text compression, text mining, natural language processing, automata based string processing, IR modelling, indexing, ranking and filtering, interface design, visualization, cross-lingual IR systems, multimedia IR, digital libraries, collaborative retrieval, Web related applications, DNA sequencing and applications in molecular biology, evolution and phylogenetics, recognition of genes and regulatory elements, sequence driven protein structure prediction, XML, SGML, information retrieval from semi-structured data, text mining and generation of structured data from text.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aBaeza-Yates, R.
_eeditor.
_q(Ricardo).
_9299615
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540755296
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-75530-2
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c298193
_d298193