199 search results - page 4 / 40 » Fast Algorithms for Computing Tree LCS |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
VLSID
2005
IEEE
14 years 6 months ago
2005
IEEE
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Phylogenetics has gained in public favor for the analysis of DNA sequence data as molecular biology has advanced. Among a number of algorithms for phylogenetics, the fastDNAml is c...