520 search results - page 25 / 104 » Subset Counting in Trees |
ISMB
1993
13 years 9 months ago
1993
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
DAM
1998
13 years 7 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
BROADCOM
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper we propose and analyze an efficient flooding technique for static multi-hop wireless networks. The protocol builds up a routing tree that connects all network nodes....