20,560 Hits in 3.2 sec

Partitional vs Hierarchical Clustering Using a Minimum Grammar Complexity Approach [chapter]

Ana L. N. Fred, José M. N. Leitão
2000 Lecture Notes in Computer Science  
Adopting the grammar formalism for representing both individual sequences and sets of patterns, a partitional clustering algorithm is proposed.  ...  This paper addresses the problem of structural clustering of string patterns.  ...  Similarity matrix for the string patterns in figure 1.  ... 
doi:10.1007/3-540-44522-6_20 fatcat:2enftgldyfathodh7kr3mpzvlm

Basic Gene Grammars and DNA-ChartParser for language processing of Escherichia coli promoter DNA sequences

S.-w. Leung, C. Mellish, D. Robertson
2001 Bioinformatics  
Most formal grammars in this field are expressed using Definite Clause Grammars but these have computational limitations which must be overcome.  ...  Motivation: The field of 'DNA linguistics' has emerged from pioneering work in computational linguistics and molecular biology.  ...  Grammars of weight matrices A weight matrix, also called a frequency matrix, is more informative than a consensus sequence in representing a DNA sequence pattern.  ... 
doi:10.1093/bioinformatics/17.3.226 pmid:11294788 fatcat:ejrgvvzpz5eorieljpsx6ko2z4

Code Instruction Selection Based on SSA-Graphs [chapter]

Erik Eckstein, Oliver König, Bernhard Scholz
2003 Lecture Notes in Computer Science  
Patterns defined as graph grammar guide the instruction selection to find (nearly) optimal results.  ...  We present an approach which maps the pattern matching problem to a partitioned boolean quadratic optimization problem (PBQP).  ...  Instead a grammar for SSA-graph matching must contain rules for matching φ-terms. In the example grammar the Rules (12) and (13) are no longer needed.  ... 
doi:10.1007/978-3-540-39920-9_5 fatcat:75wv52iqojh2bkqquw26n5v7yi

Inferring Chemical Reaction Patterns Using Rule Composition in Graph Grammars [article]

Jakob L. Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler
2012 arXiv   pre-print
We iteratively apply these rule compositions to elementary transformations in order to automatically infer complex transformation patterns.  ...  The automatically inferred graph grammar rule is a generic representative that also covers the overall reaction pattern of the Formose cycle, namely two carbonyl groups that can react with a bound glycolaldehyde  ...  Acknowledgments This work was supported in part by the Volkswagen Stiftung proj. no.  ... 
arXiv:1208.3153v2 fatcat:uthyaue62vdarbbbnwem3gpgxq

Automated DNA Motif Discovery [article]

W. B. Langdon, Olivia Sanchez Graillet, A. P. Harrison
2010 arXiv   pre-print
Ensembl's human non-coding and protein coding genes are used to automatically find DNA pattern motifs.  ...  The evolved motif suggests the presence of Thymine followed by one or more Adenines etc. early in transcripts indicate a non-protein coding gene.  ...  However the patterns are usually distinct in that, even in a gene which is matched by more than one of the 7 patterns, a part of the DNA which matches one is unlikely to also match another.  ... 
arXiv:1002.0065v1 fatcat:scdo4jlcxjafxdeowvp64n5zjm

Research on Automatic Pattern Acquisition Based on Construction Extension

Yu Chen, Dequan Zheng, Bowen Zheng, Tiejun Zhao
2010 Journal of Convergence Information Technology  
The patterns produced in this way would be the accurate patterns.  ...  One method is based on soft match. The other method is based on constituent extension.  ...  Put initial value to first row of matrix d from 0 to i in order and put initial value to first column of matrix d from 0 to j in order. 3) Scan these two patterns in order.  ... 
doi:10.4156/jcit.vol5.issue1.14 fatcat:gvcqulcutfbohj54sznq554ggi

Similarity Measures and Clustering of String Patterns [chapter]

Ana Fred
2003 Pattern Recognition and String Matching  
The distinction between string matching and structural resemblance is stressed.  ...  A clustering of structural patterns consists of an unsupervised association of data based on the similarity of their structures and primitives.  ...  Grammar Complexity-based Dissimilarity Grammars are compact representations of structural rules of composition in string patterns.  ... 
doi:10.1007/978-1-4613-0231-5_7 fatcat:ntxyaqvk5re7xc6abdd54s7umm

A Comparative Study of String Dissimilarity Measures in Structural Clustering [chapter]

Ana L. N. Fred, José M. N. Leitão
1999 International Conference on Advances in Pattern Recognition  
on the concept of reduction in grammatical complexity; string matching and error-correcting parsing.  ...  This paper addresses structural clustering by stressing the distinction between string matching and structural resemblance.  ...  String matching techniques are best suited for exact recognition of patterns. Grammatical inference-based methods are more reliable in grouping of variable length patterns with regular structures.  ... 
doi:10.1007/978-1-4471-0833-7_39 fatcat:23k3jnshyfcr3aat6fr3aafmam

Inferring chemical reaction patterns using rule composition in graph grammars

Jakob L Andersen, Christoph Flamm, Daniel Merkle, Peter F Stadler
2013 Journal of Systems Chemistry  
We iteratively apply these rule compositions to elementary transformations in order to automatically infer complex transformation patterns.  ...  It is often convenient, in particular in the analysis of larger systems, to summarize several subsequent reactions into a single composite chemical reaction.  ...  Acknowledgments This work was supported in part by the Volkswagen Stiftung proj. no.  ... 
doi:10.1186/1759-2208-4-4 fatcat:rymuzl357bc2xb2nmkih5xawxe

Page 231 of Computational Linguistics Vol. 15, Issue 4 [page]

1989 Computational Linguistics  
We have presented a theory of bottom-up parsing that is general in the sense that it does not rely on a particular pattern-matching mechanism—it applies to any mecha- nism for which the results of Section  ...  We claim that these results should hold for any reasonable pattern-matching mechanism; the reader must judge this claim by his or her own intuition.  ... 

A Generalized Tree Matching Algorithm Considering Nested Lists for Web Data Extraction [chapter]

Nitin Jindal, Bing Liu
2010 Proceedings of the 2010 SIAM International Conference on Data Mining  
Due to the fact that lists in trees may have different lengths, the match score of the trees can be very low although they follow exactly the same template pattern.  ...  This paper proposes a generalized tree matching algorithm by extending an existing tree matching algorithm with the ability to handle nested lists through a novel grammar generation algorithm.  ...  in grammar g A or in grammar g B do 3 Let S A and S B be the list of child sub-trees in A and B respectively, which are assigned the same symbol in the instances of that pattern 4 Let, S A = {S  ... 
doi:10.1137/1.9781611972801.81 dblp:conf/sdm/JindalL10 fatcat:qaeeopux75fivkcetz6rgntgwi

An Automatic Parallelizing Model for Sequential Code Using Python

Afif J. Almghawish, Ayman M. Abdalla, Ahmad B. Marzouq
2017 International Journal of Advanced Research in Computer Science and Software Engineering  
In addition to parallelizing sequential code, it is include a method for detecting recursive functions.  ...  Pattern Matching This step is done to match the generated pattern with Pattern Rules based on the Python lib2to3.fixer library, as shown in Fig. 4 . def transform(self, node, results): name = results[  ...  By using the information described in the lib2to3 grammar pattern, the general rules for the generation of pattern rules are established.  ... 
doi:10.23956/ijarcsse/v7i3/01324 fatcat:szv4jnjbjzeynnypmgi2rqjmru

Attributed Graph Modeling with Vertex Replacement Grammars [article]

Satyaki Sikdar, Neil Shah, Tim Weninger
2021 arXiv   pre-print
Experiments on large real-world datasets show that graphs generated from the AVRG model exhibit substructures and attribute configurations that match those found in the input networks.  ...  It is based on context-free string grammars and works by encoding graph rewriting rules into a graph grammar containing graphlets and instructions on how they fit together.  ...  Graph grammars contain graphical rewriting rules that match and replace graph fragments, similar to how a context-free string grammar rewrites characters in a string.  ... 
arXiv:2110.06410v1 fatcat:yxa4fjo2rzcb5d6t66q3anv564

Grammatical Inference of Dashed Lines

Arnold Jonk, Rein van den Boomgaard, Arnold Smeulders
1999 Computer Vision and Image Understanding  
A method is presented, based on syntactical pattern recognition, capable of inferring arbitrary grammars without a priori knowledge.  ...  Dashed lines are a common, and semantically important, element in line drawings. This paper deals with the inference of a dashed lines' grammar, given a stream of graphical symbols.  ...  In Fig. 14 , a matrix is presented. In the matrix the number of times a literal is followed by another is tabulated. The matrix is visualized by a weighted directed graph, as shown in Fig. 14b .  ... 
doi:10.1006/cviu.1999.0753 fatcat:xlrhbcmms5devbasv4xlzxeema

Real-Time 3D Motion Recognition of Skeleton Animation Data Stream

Jianchao Lv, Shuangjiu Xiao
2013 International Journal of Machine Learning and Computing  
matching in this sequence.  ...  In motion recognition process, the sequence of recognized candidate sub-motions is analyzed by HMM (Hidden Markov Model) to gain certain robustness, then we recognize the second level of motions by pattern  ...  ACKNOWLEDGMENT We would like to thank members of DALab in School of Software who offer valuable advices and help in implementing part of the recognition framework and data collection.  ... 
doi:10.7763/ijmlc.2013.v3.354 fatcat:nj67zrjjf5fdlj4kih3zra4any
« Previous Showing results 1 — 15 out of 20,560 results