Sciweavers

371 search results - page 42 / 75
» Algorithms for phylogenetic footprinting
Sort
View
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
14 years 2 months ago
3D floorplanning with thermal vias
Abstract— 3D circuits have the potential to improve performance over traditional 2D circuits by reducing wirelength and interconnect delay. One major problem with 3D circuits is ...
Eric Wong, Sung Kyu Lim
RECOMB
2009
Springer
14 years 9 months ago
How Many Bootstrap Replicates Are Necessary?
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
Nicholas D. Pattengale, Masoud Alipour, Olaf R. P....
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
14 years 3 days ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
SC
1995
ACM
14 years 21 hour ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
GIS
2008
ACM
14 years 9 months ago
Fast and extensible building modeling from airborne LiDAR data
This paper presents an automatic algorithm which reconstructs building models from airborne LiDAR (light detection and ranging) data of urban areas. While our algorithm inherits t...
Qian-Yi Zhou, Ulrich Neumann