String Processing and Information Retrieval 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings / edited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira.

This volume of the Lecture Notes in Computer Science series provides a c- prehensive, state-of-the-art survey of recent advances in string processing and information retrieval. It includes invited and research papers presented at the 10th International Symposium on String Processing and Information...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Nascimento, Mario A. (Editor), Moura, Edleno S. de (Editor), Oliveira, Arlindo L. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Edition:1st ed. 2003.
Series:Lecture Notes in Computer Science, 2857
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3196721
003 MWH
005 20191024182251.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 |a 9783540399841 
024 7 |a 10.1007/b14038  |2 doi 
035 |a (DE-He213)978-3-540-39984-1 
050 4 |a E-Book 
072 7 |a UMZ  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
072 7 |a UMZ  |2 thema 
072 7 |a UL  |2 thema 
245 1 0 |a String Processing and Information Retrieval  |h [electronic resource] :  |b 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings /  |c edited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira. 
250 |a 1st ed. 2003. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2003. 
300 |a CCCXCVI, 384 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 2857 
490 1 |a Springer eBook Collection 
505 0 |a Invited Papers -- Patterns on the Web -- Current Challenges in Bioinformatics -- Web Algorithms -- What’s Changed? Measuring Document Change in Web Crawling for Search Engines -- Link Information as a Similarity Measure in Web Classification -- A Three Level Search Engine Index Based in Query Log Distribution -- Bit-Parallel Algorithms -- Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm -- Alternative Algorithms for Bit-Parallel String Matching -- Bit-Parallel Approximate String Matching Algorithms with Transposition -- Compression -- Processing of Huffman Compressed Texts with a Super-Alphabet -- (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases -- Linear-Time Off-Line Text Compression by Longest-First Substitution -- SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases -- Categorization and Ranking -- Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model -- An Empirical Comparison of Text Categorization Methods -- Improving Text Retrieval in Medical Collections Through Automatic Categorization -- Music Retrieval -- A Bit-Parallel Suffix Automaton Approach for (?,?)-Matching in Music Retrieval -- Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval -- Multilingual Information Retrieval -- FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm -- Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants -- The Implementation and Evaluation of a Lexicon-Based Stemmer -- French Noun Phrase Indexing and Mining for an Information Retrieval System -- Subsequences and Distributed Algorithms -- New Refinement Techniques for Longest Common Subsequence Algorithms -- The Size of Subsequence Automaton -- Distributed Query Processing Using Suffix Arrays -- Algorithms on Strings and Trees -- BFT: Bit Filtration Technique for Approximate String Join in Biological Databases -- A Practical Index for Genome Searching -- Using WordNet for Word Sense Disambiguation to Support Concept Map Construction -- Memory-Adaptative Dynamic Spatial Approximation Trees -- Large Edit Distance with Multiple Block Operations. 
520 |a This volume of the Lecture Notes in Computer Science series provides a c- prehensive, state-of-the-art survey of recent advances in string processing and information retrieval. It includes invited and research papers presented at the 10th International Symposium on String Processing and Information Retrieval, SPIRE 2003, held in Manaus, Brazil. SPIRE 2003 received 54 full submissions from 17 countries, namely: - gentina(2), Australia(2), Brazil(9),Canada(1),Chile (4),Colombia(2),Czech Republic (1), Finland (10), France (1), Japan (2), Korea (5), Malaysia (1), P- tugal (2), Spain (6), Turkey (1), UK (1), USA (4) – the numbers in parentheses indicate the number of submissions from that country. In the nontrivial task of selecting the papers to be published in these proceedings we were fortunate to count on a very international program committee with 43 members, represe- ing all continents but one. These people, in turn, used the help of 40 external referees. During the review processall but a few papers had four reviewsinstead of the usual three, and at the end 21 submissions were accepted to be p- lished as full papers, yielding an acceptance rate of about 38%. An additional set of six short papers was also accepted. The technical program spans over the two well-de?ned scopes of SPIRE (string processing and information retrieval) with a number of papers also focusing on important application domains such as bioinformatics. SPIRE 2003 also features two invited speakers: Krishna Bharat (Google, Inc. ) and Joa ˜o Meidanis (State Univ. of Campinas and Scylla Bioinformatics). 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Software engineering. 
650 0 |a Information storage and retrieval. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Database management. 
690 |a Electronic resources (E-books) 
700 1 |a Nascimento, Mario A.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Moura, Edleno S. de.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Oliveira, Arlindo L.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2857 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/b14038  |3 Click to view e-book 
907 |a .b31967218  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21098840  |z 02-26-20 
999 f f |i ec923f37-1ec8-5e77-81ab-d4e8a3befa62  |s f84d6422-d293-59c5-a4b9-81f5a7950311 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |e E-Book  |h Library of Congress classification  |i Elec File  |n 1