Sciweavers

3928 search results - page 61 / 786
» order 2006
Sort
View
139
Voted
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 4 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
BMCBI
2006
242views more  BMCBI 2006»
15 years 4 months ago
Predicting residue-wise contact orders in proteins by support vector regression
Background: The residue-wise contact order (RWCO) describes the sequence separations between the residues of interest and its contacting residues in a protein sequence. It is a ne...
Jiangning Song, Kevin Burrage
BMCBI
2006
112views more  BMCBI 2006»
15 years 4 months ago
Protein disorder prediction by condensed PSSM considering propensity for order or disorder
Background: More and more disordered regions have been discovered in protein sequences, and many of them are found to be functionally significant. Previous studies reveal that dis...
Chung-Tsai Su, Chien-Yu Chen, Yu-Yen Ou
LICS
2006
IEEE
15 years 10 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 4 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud