1522 search results - page 57 / 305 » On the Complexity of Several Haplotyping Problems |
WG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
IRI
2006
IEEE
14 years 1 months ago
2006
IEEE
The development of solutions to complex problems requires finding answers to several questions which are obstacles on the road leading to the solution. To perpetuate progress, the...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
RR
2010
Springer
13 years 6 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
WIA
2005
Springer
14 years 1 months ago
2005
Springer
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...