Sciweavers

672 search results - page 31 / 135
» Words and forbidden factors
Sort
View
BMCBI
2008
134views more  BMCBI 2008»
14 years 9 months ago
Identification of transcription factor contexts in literature using machine learning approaches
Background: Availability of information about transcription factors (TFs) is crucial for genome biology, as TFs play a central role in the regulation of gene expression. While man...
Hui Yang, Goran Nenadic, John A. Keane
SIAMSC
2010
142views more  SIAMSC 2010»
14 years 4 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
CONCUR
2010
Springer
14 years 10 months ago
A Geometric Approach to the Problem of Unique Decomposition of Processes
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
Thibaut Balabonski, Emmanuel Haucourt
DAM
2011
14 years 4 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
56
Voted
DLT
2009
14 years 7 months ago
Crucial Words for Abelian Powers
A word is crucial with respect to a given set of prohibited words (or simply prohibitions) if it avoids the prohibitions but it cannot be extended to the right by any letter of its...
Amy Glen, Bjarni V. Halldórsson, Sergey Kit...