A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Stochastic Regular Approximation of Tree Grammars and Its Application to Faster ncRNA Family Annotation
2007
IPSJ Digital Courier
Tree Adjoining Grammar (TAG) is a useful grammatical tool to model RNA secondary structures containing pseudoknots, but its time complexity for parsing is not small enough for the practical use. Recently, Weinberg and Ruzzo proposed a method of approximating stochastic context free grammar by stochastic regular grammar and applied it to faster genome annotation of non-coding RNA families. This paper proposes a method for extending their idea to stochastic approximation of TAGs by regular
doi:10.2197/ipsjdc.3.746
fatcat:5hpy3aoryvay5ketu6m4lqosny