String Processing and Information Retrieval
Chavez, Edgar.
String Processing and Information Retrieval 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings / [recurso electrónico] : edited by Edgar Chavez, Stefano Lonardi. - XIV, 408p. 81 illus. online resource. - Lecture Notes in Computer Science, 6393 0302-9743 ; . - Lecture Notes in Computer Science, 6393 .
Crowdsourcing and Recommendation -- Querying the Web Graph -- Incremental Algorithms for Effective and Efficient Query Recommendation -- Fingerprinting Ratings for Collaborative Filtering — Theoretical and Empirical Analysis -- On Tag Spell Checking -- Indexes and Compressed Indexes -- Compressed Self-indices Supporting Conjunctive Queries on Document Collections -- String Retrieval for Multi-pattern Queries -- Colored Range Queries and Document Retrieval -- Range Queries over Untangled Chains -- Theory -- Multiplication Algorithms for Monge Matrices -- Why Large Closest String Instances Are Easy to Solve in Practice -- A PTAS for the Square Tiling Problem -- On the Hardness of Counting and Sampling Center Strings -- String Algorithms I -- Counting and Verifying Maximal Palindromes -- Identifying SNPs without a Reference Genome by Comparing Raw Reads -- Dynamic Z-Fast Tries -- Improved Fast Similarity Search in Dictionaries -- Compression -- Training Parse Trees for Efficient VF Coding -- Algorithms for Finding a Minimum Repetition Representation of a String -- Faster Compressed Dictionary Matching -- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval -- Querying and Search User Experience -- Standard Deviation as a Query Hardness Estimator -- Using Related Queries to Improve Web Search Results Ranking -- Evaluation of Query Performance Prediction Methods by Range -- Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy -- String Algorithms II -- Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems -- Restricted LCS -- Extracting Powers and Periods in a String from Its Runs Structure -- On Shortest Common Superstring and Swap Permutations -- Document Analysis and Comparison -- A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles -- Temporal Analysis of Document Collections: Framework and Applications -- Text Comparison Using Soft Cardinality -- Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval -- Compressed Indexes -- Dual-Sorted Inverted Lists -- CST++ -- Succinct Representations of Dynamic Strings -- Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes -- The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching -- String Matching -- Parameterized Searching with Mismatches for Run-Length Encoded Strings -- Fast Bit-Parallel Matching for Network and Regular Expressions -- String Matching with Variable Length Gaps -- Approximate String Matching with Stuck Address Bits -- Erratum -- Erratum to: Range Queries over Untangled Chains.
Thisvolumecontainsthe paperspresentedatthe 17thInternationalSymposium on String Processing and Information Retrieval (SPIRE 2010), held October 11–13, 2010 in Los Cabos, Mexico. The annual SPIRE conference provides researchers within ?elds related to string processing and/or information retrieval a possibility to present their or- inal contributions and to meet and talk with other researchers with similar - terests. The call for papers invited submissions related to string processing (d- tionary algorithms; text searching; pattern matching; text and sequence c- pression; automata-based string processing), information retrieval (information retrieval models; indexing; ranking and ?ltering; querying and interface design), natural language processing (text analysis; text mining; machine learning; - formation extraction; language models; knowledge representation), searchapp- cations and usage (cross-lingual information access systems; multimedia inf- mation access; digital libraries; collaborative retrieval and Web-related appli- tions; semi-structured data retrieval; evaluation), and interaction of biology and computation (DNA sequencing and applications in molecular biology; evolution andphylogenetics;recognitionofgenesandregulatoryelements;sequencedriven protein structure prediction). The papers presented at the symposium were selected from 109 submissions written by authors from 30 di?erent countries. Each submission was reviewed by at least three reviewers, with a maximum of ?ve reviews for particularly challengingpapers. The ProgramCommittee accepted 39 papers(corresponding to ?35% acceptance rate): 26 long papers and 13 short papers. In addition to these presentations, SPIRE 2010 also featured invited talks by Gonzalo Navarro (Universidad de Chile) and Mark Najork (Microsoft Research, USA).
9783642163210
Computer science.
Database management.
Data mining.
Information storage and retrieval systems.
Multimedia systems.
Optical pattern recognition.
Bioinformatics.
Computer Science.
Information Storage and Retrieval.
Computational Biology/Bioinformatics.
Data Mining and Knowledge Discovery.
Database Management.
Pattern Recognition.
Multimedia Information Systems.
QA75.5-76.95
025.04
String Processing and Information Retrieval 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings / [recurso electrónico] : edited by Edgar Chavez, Stefano Lonardi. - XIV, 408p. 81 illus. online resource. - Lecture Notes in Computer Science, 6393 0302-9743 ; . - Lecture Notes in Computer Science, 6393 .
Crowdsourcing and Recommendation -- Querying the Web Graph -- Incremental Algorithms for Effective and Efficient Query Recommendation -- Fingerprinting Ratings for Collaborative Filtering — Theoretical and Empirical Analysis -- On Tag Spell Checking -- Indexes and Compressed Indexes -- Compressed Self-indices Supporting Conjunctive Queries on Document Collections -- String Retrieval for Multi-pattern Queries -- Colored Range Queries and Document Retrieval -- Range Queries over Untangled Chains -- Theory -- Multiplication Algorithms for Monge Matrices -- Why Large Closest String Instances Are Easy to Solve in Practice -- A PTAS for the Square Tiling Problem -- On the Hardness of Counting and Sampling Center Strings -- String Algorithms I -- Counting and Verifying Maximal Palindromes -- Identifying SNPs without a Reference Genome by Comparing Raw Reads -- Dynamic Z-Fast Tries -- Improved Fast Similarity Search in Dictionaries -- Compression -- Training Parse Trees for Efficient VF Coding -- Algorithms for Finding a Minimum Repetition Representation of a String -- Faster Compressed Dictionary Matching -- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval -- Querying and Search User Experience -- Standard Deviation as a Query Hardness Estimator -- Using Related Queries to Improve Web Search Results Ranking -- Evaluation of Query Performance Prediction Methods by Range -- Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy -- String Algorithms II -- Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems -- Restricted LCS -- Extracting Powers and Periods in a String from Its Runs Structure -- On Shortest Common Superstring and Swap Permutations -- Document Analysis and Comparison -- A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles -- Temporal Analysis of Document Collections: Framework and Applications -- Text Comparison Using Soft Cardinality -- Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval -- Compressed Indexes -- Dual-Sorted Inverted Lists -- CST++ -- Succinct Representations of Dynamic Strings -- Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes -- The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching -- String Matching -- Parameterized Searching with Mismatches for Run-Length Encoded Strings -- Fast Bit-Parallel Matching for Network and Regular Expressions -- String Matching with Variable Length Gaps -- Approximate String Matching with Stuck Address Bits -- Erratum -- Erratum to: Range Queries over Untangled Chains.
Thisvolumecontainsthe paperspresentedatthe 17thInternationalSymposium on String Processing and Information Retrieval (SPIRE 2010), held October 11–13, 2010 in Los Cabos, Mexico. The annual SPIRE conference provides researchers within ?elds related to string processing and/or information retrieval a possibility to present their or- inal contributions and to meet and talk with other researchers with similar - terests. The call for papers invited submissions related to string processing (d- tionary algorithms; text searching; pattern matching; text and sequence c- pression; automata-based string processing), information retrieval (information retrieval models; indexing; ranking and ?ltering; querying and interface design), natural language processing (text analysis; text mining; machine learning; - formation extraction; language models; knowledge representation), searchapp- cations and usage (cross-lingual information access systems; multimedia inf- mation access; digital libraries; collaborative retrieval and Web-related appli- tions; semi-structured data retrieval; evaluation), and interaction of biology and computation (DNA sequencing and applications in molecular biology; evolution andphylogenetics;recognitionofgenesandregulatoryelements;sequencedriven protein structure prediction). The papers presented at the symposium were selected from 109 submissions written by authors from 30 di?erent countries. Each submission was reviewed by at least three reviewers, with a maximum of ?ve reviews for particularly challengingpapers. The ProgramCommittee accepted 39 papers(corresponding to ?35% acceptance rate): 26 long papers and 13 short papers. In addition to these presentations, SPIRE 2010 also featured invited talks by Gonzalo Navarro (Universidad de Chile) and Mark Najork (Microsoft Research, USA).
9783642163210
Computer science.
Database management.
Data mining.
Information storage and retrieval systems.
Multimedia systems.
Optical pattern recognition.
Bioinformatics.
Computer Science.
Information Storage and Retrieval.
Computational Biology/Bioinformatics.
Data Mining and Knowledge Discovery.
Database Management.
Pattern Recognition.
Multimedia Information Systems.
QA75.5-76.95
025.04
