By Topic

Learning local languages and its application to protein /spl alpha/-chain identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yokomori, T. ; Dept. of Comput Sci. & Inf. Math., Univ. of Electro-Commun., Chofu, Japan ; Ishida, N. ; Kobayashi, S.

Concerns an efficient algorithm for learning in the limit a special type of regular language called a locally testable language from positive data, and its application to identifying the protein /spl alpha/-chain region in amino acid sequences. First, we present a linear-time algorithm that, given a locally testable language, learns (identifies) its deterministic finite state automaton in the limit from only positive data. This provides a practical and efficient learning method for a specific domain of symbolic analysis. We then describe several experimental results using the learning algorithm. Following a theoretical observation which strongly suggests that a certain type of amino acid sequence can be expressed by a locally testable language, we apply the learning algorithm to identifying the protein /spl alpha/-chain region in amino acid sequences for hemoglobin. Experimental scores show an overall success rate of 95% correct identification for positive data and 96% for negative data.<>

Published in:

System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on  (Volume:5 )

Date of Conference:

4-7 Jan. 1994