Sciweavers

218 search results - page 18 / 44
» Finite Trees as Ordinals
Sort
View
CSB
2005
IEEE
182views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Bacterial Whole Genome Phylogeny Using Proteome Comparison and Optimal Reversal Distance
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...
Noppadon Khiripet
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
14 years 10 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
CSR
2009
Springer
15 years 1 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
ACL
1996
14 years 11 months ago
Efficient Transformation-Based Parsing
In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules ar...
Giorgio Satta, Eric Brill