4860 search results - page 118 / 972 » SNPs Problems, Complexity, and Algorithms |
CPM
2005
Springer
14 years 3 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
ISCAS
2003
IEEE
14 years 3 months ago
2003
IEEE
High frequency digital LSIs usually consist of many subcircuits coupled with multi-conductor interconnects embedded in the substrate. They sometimes cause serious problems of the ...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
SIGECOM
2005
ACM
14 years 3 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
STACS
2000
Springer
14 years 1 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...