321 search results - page 1 / 65 » Comparison of Additive Trees Using Circular Orders |
JCB
2000
13 years 4 months ago
2000
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
IPL
2002
13 years 4 months ago
2002
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
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...
BMCBI
2006
13 years 4 months ago
2006
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
The pipelined CORDIC with linear approximation to rotation has been proposed to achieve reductions in delay, power and area; however, the schemes for rotation (multiplication) and...