—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
Abstract--Based on the false assumption that multicast incapable (MI) nodes could not be traversed twice on the same wavelength, the light-tree structure was always thought to be o...
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...