Fuzzy sets and fuzzy logic: the foundations of application—from a mathematical point of view
Fuzzy sets and fuzzy logic: the foundations of application—from a mathematical point of view
New indices for text: PAT Trees and PAT arrays
Information retrieval
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Text algorithms
Evaluating user interfaces to information retrieval systems: a case study on user support
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
A deductive data model for query expansion
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The impact of query structure and query expansion on retrieval performance
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Improving automatic query expansion
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Interactive query expansion: a user-based evaluation in a relevance feedback environment
Journal of the American Society for Information Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Indexing Nucleotide Databases for Fast Query Evaluation
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Constructing Suffix Trees On-Line in Linear Time
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Generalizations of the Periodicity Theorem of Fine and Wilf
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
A Three-Level User Interface to Multimedia Digital Libraries with Relaxation and Restriction
ADL '98 Proceedings of the Advances in Digital Libraries Conference
Formal languages and their relation to automata
Formal languages and their relation to automata
Content-based multimedia information retrieval: State of the art and challenges
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Cross-media retrieval using query dependent search methods
Pattern Recognition
A semantically-based software component selection mechanism for intelligent service robots
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
In this paper, a new technique is developed to support the query relaxation in biological databases. Query relaxation is required due to the fact that queries tend not to be expressed exactly by the users, especially in scientific databases such as biological databases, in which complex domain knowledge is heavily involved. To treat this problem, we propose the concept of the so-called fuzzy equivalence classes to capture important kinds of domain knowledge that is used to relax queries. This concept is further integrated with the canonical techniques for pattern searching such as the position tree and automaton theory. As a result, fuzzy queries produced through relaxation can be efficiently evaluated. This method has been successfully utilized in a practical biological database - the GPCRDB.