Generalization of a Suffix Tree for RNA Structural Pattern Matching

Author(s):  
Tetsuo Shibuya
1998 ◽  
Vol 4 (2) ◽  
pp. 97-114 ◽  
Author(s):  
DEKANG LIN

With the emergence of broad-coverage parsers, quantitative evaluation of parsers becomes increasingly more important. We propose a dependency-based method for evaluating broad-coverage parsers that offers more meaningful performance measures than previous approaches. We also present a structural pattern-matching mechanism that can be used to eliminate inconsequential differences among different parse trees. Previous evaluation methods have only evaluated the overall performance of parsers. The dependency-based method can also evaluate parsers with respect to different kinds of grammatical relationships or different types of lexical categories. An algorithm for transforming constituency trees into dependency trees is presented, which makes the evaluation method applicable to both constituency grammars and dependency grammars.


Author(s):  
Patrick Delfmann ◽  
Sebastian Herwig ◽  
Lukasz Lis ◽  
Jörg Becker

Analysis of conceptual models is useful for a number of purposes, such as revealing syntactical errors, model comparison, model integration, and identification of business process improvement potentials, with both the model structure and the model contents having to be considered. In this contribution, we introduce a generic model analysis approach. Unlike existing approaches, we do not focus on a certain application problem or a specific modeling language. Instead, our approach is generic, making it applicable for any analysis purpose and any graph-based conceptual modeling language. The approach integrates pattern matching for structural analysis and linguistic standardization enabling an unambiguous analysis of the models’ contents.


2018 ◽  
Vol 21 (4) ◽  
pp. 1151-1165 ◽  
Author(s):  
Na Liu ◽  
Fei Xie ◽  
Xindong Wu

Author(s):  
GEORGE WOLBERG

This paper introduces a syntactic omni-font character recognition system. The "omni-font" attribute reflects the wide range of fonts that fall within the class of characters that can be recognized. This includes hand-printed characters as well. A structural pattern-matching approach is employed. Essentially, a set of loosely constrained rules specify pattern components and their interrelationships. The robustness of the system is derived from the orthogonal set of pattern descriptors, location functions, and the manner in which they are combined to exploit the topological structure of characters. By virtue of the new pattern description language, PDL, developed in this paper, the user may easily write rules to define new patterns for the system to recognize. The system also features scale-invariance and user-definable sensitivity to tilt orientation.


2009 ◽  
Vol 9 (1) ◽  
pp. 15 ◽  
Author(s):  
Ségolène Caboche ◽  
Maude Pupin ◽  
Valérie Leclère ◽  
Phillipe Jacques ◽  
Gregory Kucherov

Sign in / Sign up

Export Citation Format

Share Document