FURY: Fuzzy unification and resolution based on edit distance

Proceedings - IEEE International Symposium on Bio-Informatics and Biomedical Engineering, BIBE 2000

Volumn , Issue , 2000, Pages 330-336

  Gilbert, D ^a   Schroeder, M ^a  

^a CITY UNIVERSITY   (United Kingdom)

Author keywords

Artificial intelligence; Biochemistry; Bioinformatics; Databases; Dynamic programming; Fuzzy logic; Fuzzy sets; History; Informatics; Uncertainty

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIOCHEMISTRY; BIOINFORMATICS; BIOMEDICAL ENGINEERING; DATABASE SYSTEMS; FUZZY LOGIC; FUZZY SETS; HISTORY; INFORMATION SCIENCE;

EDIT DISTANCE; FUZZY UNIFICATION; INFORMATICS; LARGE PROBLEMS; TYPOGRAPHICAL ERRORS; UNCERTAINTY;

DYNAMIC PROGRAMMING;

EID: 84952328265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2000.889625     Document Type: Conference Paper

References (16)

1. A. V. Aho and T. G. Peterson. A minimum distance error-correcting parser for context-free languages. SIAM Journal on Computing, 1(4):305-312, Dec. 1972.
2. S. Embury, A. Jones, I. Sutherland, W. Gray, R. White, J. Robinson, F. Bisby, and S. Brandt. Conflict detection for integration of taxonomic data sources. In Proceedings of the 11th International Conference on Scientific and Statistical Database Management, pages 204-213, 1999.
3. F. A. Fontana, F. formato, and G. Gerla. Fuzzy unification as a foundation of fuzzy logic programming. In Logic Programming and Soft Computing, pages 51-68. Research Studies Press, 1998.
4. P. Fung, M. Brayshaw, B. du Boulay, and M. Elsom-Cook. Towards a taxonomy of misconceptions of the prolog interpreter. In P. Brna, B. du Boulay, and H. Pain, editors, Learning to Build and Comprehend Complex Information Structures: Prolog as a Case Study. Ablex, 1999.
5. D. Gilbert, D. Westhead, J. Viksna, and J. Thornton. Topology-based protein structure comparison using a pattern discovery technique. In submitted to AISB2000 (Artificial Intelligence in Bioinformatics), 2000.
6. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. CUP, 1997.
7. R. A. Kowalski. Logic for Problem Solving. Elsevier, 1979.
8. P. Krisko, P. Marcincak, P. Mihok, and J. Sabol. Low retrieval remote querying dialogue with fuzzy conceptual, syntactical and linguistical unification. Lecture Notes in Computer Science, 1495:215-??, 1998.
9. V. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii nauk SSSR (in Russian), 163(4):845-848, 1965.
10. Cybernetics and Control Theory, vol 10, no. 8, pp 707-710, 1996.
11. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.
12. R. Lowrance and R. A. Wagner. An extension of the string-to-string correction problem. Journal of the ACM, 22(2):177-183, Apr. 1975.
13. J. A. Robinson. A machine oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-42, 1965.
14. D. Schomburg, D. Salzmann, and D. Stephan. Enzyme Handbook, Classes 1-6. Springer, 1995. http://www.brenda.uni-koeln.de.
15. E. Vidal, A. Marzal, and P. Aibar. Fast computation of normalized edit distances. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(9):899-902, Sept. 1995.
16. R. A. Wagner and M. J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168-173, Jan. 1974.