84 search results - page 12 / 17 » Efficient Enumeration of Regular Languages |
130
Voted
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
132
Voted
CAV
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
123
Voted
ISMB
2000
15 years 5 months ago
2000
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...
110
Voted
JAIR
2008
15 years 3 months ago
2008
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
141
Voted
EMNLP
2009
15 years 1 months ago
2009
We present a new phrase-based conditional exponential family translation model for statistical machine translation. The model operates on a feature representation in which sentenc...