1200 search results - page 26 / 240 » Marked Ancestor Problems |
CPE
1998
Springer
14 years 2 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
RECOMB
2009
Springer
14 years 10 months ago
2009
Springer
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
EDBT
2009
ACM
14 years 4 months ago
2009
ACM
Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result...
BMCBI
2011
13 years 4 months ago
2011
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
IWDW
2005
Springer
14 years 3 months ago
2005
Springer
In a fingerprinting scheme a distributor places marks in each copy of a digital object. Placing different marks in different copies, uniquely identifies the recipient of each cop...