M. Stanley Fujimoto

Learn More
Although television exposure levels during infancy are high, the impact of such exposure on learning is relatively unknown. Initial studies have shown that infants imitate significantly fewer target actions from a televised demonstration than they imitate from a live demonstration. It was hypothesized that increasing the duration of exposure to the(More)
Genome-wide association studies (GWAS) have effectively identified genetic factors for many diseases. Many diseases, including Alzheimer’s disease (AD), have epistatic causes, requiring more sophisticated analyses to identify groups of variants which together affect phenotype. Based on the GWAS statistical model, we developed a multi-SNP GWAS analysis to(More)
Acknowledgements This report is dedicated to the young children of Hawai'i and to the teachers and family members who support their healthy development. We would like to thank the staff of the pilot schools that provided information. We also thank the following individuals for their assistance with this evaluation. DOE Evaluation Specialist provided(More)
Next-Generation Sequencing experiments have been used to identify genotypes that are associated with many medical conditions. An important part of Next Generation read processing is the mapping of short reads to a reference genome. Although many algorithms have been created to perform this mapping, there are many reads that cannot be mapped because they are(More)
Genome assemblers to date have predominantly targeted haploid reference reconstruction from homozygous data. When applied to diploid genome assembly, these assemblers perform poorly, owing to the violation of assumptions during both the contigging and scaffolding phases. Effective tools to overcome these problems are in growing demand. Increasing parameter(More)
In the context of genome assembly, the contig orientation problem is described as the problem of removing sufficient edges from the scaffold graph so that the remaining subgraph assigns a consistent orientation to all sequence nodes in the graph. This problem can also be phrased as a weighted MAX-CUT problem. The performance of MAX-CUT heuristics in this(More)