By Topic

Table Based Parsing for RNA

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

1 Author(s)
Al-Mulhem, M.S. ; Inf. & Comput. Sci. Dept., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia

Formal grammars have been used extensively in the analysis and design of programming languages and compilers. This paper gives a brief introduction to the application of stochastic context free grammars (SCFGs) to model RNA. Then it briefly presents the parsing algorithm for RNA. Next it introduces the bottom-up LR parsing algorithm. Finally it proposes a table-based parsing algorithm for RNA. The proposed algorithm is an extension of the LR parsing algorithm.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:1 )

Date of Conference:

March 31 2009-April 2 2009