Sciweavers

649 search results - page 50 / 130
» An Improved Construction of Progression-Free Sets
Sort
View
91
Voted
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 10 days ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
86
Voted
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 23 days ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
113
Voted
IMR
2007
Springer
15 years 6 months ago
Automatic 3D Mesh Generation for a Domain with Multiple Materials
Abstract: This paper describes an approach to construct unstructured tetrahedral and hexahedral meshes for a domain with multiple materials. In earlier works, we developed an octre...
Yongjie Zhang, Thomas Hughes, Chandrajit L. Bajaj
BMCBI
2007
197views more  BMCBI 2007»
15 years 18 days ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
94
Voted
BMCBI
2006
92views more  BMCBI 2006»
15 years 16 days ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...