A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Building a scalable and accurate copy detection mechanism
Proceedings of the first ACM international conference on Digital libraries
PAT-tree-based keyword extraction for Chinese information retrieval
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Layered index structures in document database systems
Proceedings of the seventh international conference on Information and knowledge management
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Fast string searching in secondary storage: theoretical developments and experimental results
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
IEPAD: information extraction based on pattern discovery
Proceedings of the 10th international conference on World Wide Web
Two-dimensional substring indexing
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Chinese keyword extraction based on max-duplicated strings of the documents
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
On the efficient evaluation of relaxed queries in biological databases
Proceedings of the eleventh international conference on Information and knowledge management
Tries for Approximate String Matching
IEEE Transactions on Knowledge and Data Engineering
A dynamic construction algorithm for the compact patricia trie using the hierarchical structure
Information Processing and Management: an International Journal
Automatic information extraction from semi-structured Web pages by pattern discovery
Decision Support Systems - Web retrieval and mining
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Applying Pattern Mining to Web Information Extraction
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Incremental Extraction of Keyterms for Classifying Multilingual Documents in the Web
PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Optimal Exact Strring Matching Based on Suffix Arrays
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Efficient Data Mining from Large Text Databases
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Indexing Text with Approximate q-Grams
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Efficient Discovery of Proximity Patterns with Suffix Arrays
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Finding Meaningful Regions Containing Given Keywords from Large Text Collections
DS '99 Proceedings of the Second International Conference on Discovery Science
A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Comparison of Two Persistent Storage Tools for Implementing a Search Engine
POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
Indexing Semistructured Data Using PATRICIA Tree
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Representing Trees of Higer Degree
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Searching large text collections
Handbook of massive data sets
An Index Structure for Pattern Similarity Searching in DNA Microarray Data
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
A Heuristics-Based Approach to Query Optimization in Structured Document Databases
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Two-dimensional substring indexing
Journal of Computer and System Sciences - Special issu on PODS 2001
A morphology-driven string matching approach to Arabic text searching
Journal of Systems and Software
MARSYAS: a framework for audio analysis
Organised Sound
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms - SPIRE 2002
Translating unknown cross-lingual queries in digital libraries using a web-based approach
Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries
A fast algorithm for the generalized k-keyword proximity problem given keyword offsets
Information Processing Letters
Word prediction using a clustered optimal binary search tree
Information Processing Letters
A categorization theorem on suffix arrays with applications to space efficient text indexes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Knowledge map creation and maintenance for virtual communities of practice
Information Processing and Management: an International Journal
Exploiting the Web as the multilingual corpus for unknown query translation
Journal of the American Society for Information Science and Technology
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
Fast and space efficient string kernels using suffix arrays
ICML '06 Proceedings of the 23rd international conference on Machine learning
When indexing equals compression: Experiments with compressing suffix arrays and applications
ACM Transactions on Algorithms (TALG)
Linear work suffix array construction
Journal of the ACM (JACM)
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
Theoretical Computer Science
Scalable parallel suffix array construction
Parallel Computing
Extracting lists of data records from semi-structured web pages
Data & Knowledge Engineering
Dynamic entropy-compressed sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Counting suffix arrays and strings
Theoretical Computer Science
Better external memory suffix array construction
Journal of Experimental Algorithmics (JEA)
An Online Algorithm for Finding the Longest Previous Factors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A four-stage algorithm for updating a Burrows-Wheeler transform
Theoretical Computer Science
Compressed Suffix Arrays for Massive Data
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
Knowledge map creation and maintenance for virtual communities of practice
Information Processing and Management: an International Journal
Word prediction using a clustered optimal binary search tree
Information Processing Letters
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
Finding and Extracting Data Records from Web Pages
Journal of Signal Processing Systems
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Information Processing Letters
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Finding and extracting data records from web pages
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Using clustering and edit distance techniques for automatic web data extraction
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Compression, indexing, and retrieval for massive string data
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Fusion of multiple features and ranking SVM for web-based English-Chinese OOV term translation
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
Retrieving similar documents from the web
Journal of Web Engineering
Lightweight BWT construction for very large string collections
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Optimal string mining under frequency constraints
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Scalable parallel suffix array construction
EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Obtaining provably good performance from suffix trees in secondary storage
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Succinct text indexes on large alphabet
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Lightweight data indexing and compression in external memory
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
An efficient and practical algorithm for the many-keyword proximity problem by offsets
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Construction of aho corasick automaton in linear time for integer alphabets
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Time and space efficient search for small alphabets with suffix arrays
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
On the number of elements to reorder when updating a suffix array
Journal of Discrete Algorithms
Counting suffix arrays and strings
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Text-level structure of research papers: implications for text-based information processing systems
IRSG'97 Proceedings of the 19th Annual BCS-IRSG conference on Information Retrieval Research
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Validating web content with senser
Proceedings of the 29th Annual Computer Security Applications Conference
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
On the combinatorics of suffix arrays
Information Processing Letters
Journal of Discrete Algorithms
| Hi-index | 0.00 |