218 search results - page 18 / 44 » Finite Trees as Ordinals |
126
Voted
CSB
2005
IEEE
15 years 7 months ago
2005
IEEE
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...
109
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
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...
124
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
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 ...
121
click to vote
CSR
2009
Springer
15 years 5 months ago
2009
Springer
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...
102
Voted
ACL
1996
15 years 3 months ago
1996
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...