1099 search results - page 109 / 220 » On the Complexity of Computing Evolutionary Trees |
BMCBI
2007
14 years 10 months ago
2007
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
STACS
2010
Springer
15 years 5 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
DAC
2004
ACM
15 years 1 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
115
click to vote
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
BMCBI
2007
14 years 10 months ago
2007
Background: Detection of adaptive amino acid changes in proteins under recent short-term selection is of great interest for researchers studying microevolutionary processes in mic...