63 research outputs found
Computational Complexity of Synchronization under Regular Commutative Constraints
Here we study the computational complexity of the constrained synchronization
problem for the class of regular commutative constraint languages. Utilizing a
vector representation of regular commutative constraint languages, we give a
full classification of the computational complexity of the constraint
synchronization problem. Depending on the constraint language, our problem
becomes PSPACE-complete, NP-complete or polynomial time solvable. In addition,
we derive a polynomial time decision procedure for the complexity of the
constraint synchronization problem, given some constraint automaton accepting a
commutative language as input.Comment: Published in COCOON 2020 (The 26th International Computing and
Combinatorics Conference); 2nd version is update of the published version and
1st version; both contain a minor error, the assumption of maximality in the
NP-c and PSPACE-c results (propositions 5 & 6) is missing, and of
incomparability of the vectors in main theorem; fixed in this version. See
(new) discussion after main theore
On the Number of Synchronizing Colorings of Digraphs
We deal with -out-regular directed multigraphs with loops (called simply
\emph{digraphs}). The edges of such a digraph can be colored by elements of
some fixed -element set in such a way that outgoing edges of every vertex
have different colors. Such a coloring corresponds naturally to an automaton.
The road coloring theorem states that every primitive digraph has a
synchronizing coloring.
In the present paper we study how many synchronizing colorings can exist for
a digraph with vertices. We performed an extensive experimental
investigation of digraphs with small number of vertices. This was done by using
our dedicated algorithm exhaustively enumerating all small digraphs. We also
present a series of digraphs whose fraction of synchronizing colorings is equal
to , for every and the number of vertices large enough.
On the basis of our results we state several conjectures and open problems.
In particular, we conjecture that is the smallest possible fraction of
synchronizing colorings, except for a single exceptional example on 6 vertices
for .Comment: CIAA 2015. The final publication is available at
http://link.springer.com/chapter/10.1007/978-3-319-22360-5_1
Using regulatory variants to detect gene-gene interactions identifies networks of genes linked to cell immortalization
The extent to which the impact of regulatory genetic variants may depend on other factors, such as the expression levels of upstream transcription factors, remains poorly understood. Here we report a framework in which regulatory variants are first aggregated into sets, and using these as estimates of the total cis-genetic effects on a gene we model their non-additive interactions with the expression of other genes in the genome. Using 1220 lymphoblastoid cell lines across platforms and independent datasets we identify 74 genes where the impact of their regulatory variant-set is linked to the expression levels of networks of distal genes. We show that these networks are predominantly associated with tumourigenesis pathways, through which immortalised cells are able to rapidly proliferate. We consequently present an approach to define gene interaction networks underlying important cellular pathways such as cell immortalisation
Large expert-curated database for benchmarking document similarity detection in biomedical literature search
Document recommendation systems for locating relevant literature have mostly relied on methods developed a decade ago. This is largely due to the lack of a large offline gold-standard benchmark of relevant documents that cover a variety of research fields such that newly developed literature search techniques can be compared, improved and translated into practice. To overcome this bottleneck, we have established the RElevant LIterature SearcH consortium consisting of more than 1500 scientists from 84 countries, who have collectively annotated the relevance of over 180 000 PubMed-listed articles with regard to their respective seed (input) article/s. The majority of annotations were contributed by highly experienced, original authors of the seed articles. The collected data cover 76% of all unique PubMed Medical Subject Headings descriptors. No systematic biases were observed across different experience levels, research fields or time spent on annotations. More importantly, annotations of the same document pairs contributed by different scientists were highly concordant. We further show that the three representative baseline methods used to generate recommended articles for evaluation (Okapi Best Matching 25, Term Frequency–Inverse Document Frequency and PubMed Related Articles) had similar overall performances. Additionally, we found that these methods each tend to produce distinct collections of recommended articles, suggesting that a hybrid method may be required to completely capture all relevant articles. The established database server located at https://relishdb.ict.griffith.edu.au is freely available for the downloading of annotation data and the blind testing of new methods. We expect that this benchmark will be useful for stimulating the development of new powerful techniques for title and title/abstract-based search engines for relevant articles in biomedical research
- …