Macdonald S. Morris
Stanford University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Macdonald S. Morris.
The American Naturalist | 1987
Macdonald S. Morris; Carlo Matessi; Samuel Karlin
A model for kin altruism involving multiple generations, in which altruism is directed from daughters toward their mothers, is investigated and compared with models for altruism involving a single generation. In the linear case of constant cost and benefit, the conditions for the evolution of intergenerational altruism are shown to depend on the form of expression of this gene, the criteria by which altruistic evolution is assessed, and the level of penetrance of the gene for altruism; these conditions are usually not found in intragenerational models. Central to the interpretation of these results are demographic factors and aspects of life history strategy that play an important role in intergenerational altruism. The case in which the fitnesses of the altruistic and selfish phenotypes are general functions of the fraction of altruists in the brood is also investigated. We find that the shape of these functions has important effects on the conditions for the evolution of altruism. To these effects we give a natural interpretation in terms of the properties of altruistic behavior.
Bioinformatics | 1988
Samuel Karlin; Macdonald S. Morris; Ghassan Ghandour; Ming Ying Leung
Efficient algorithms are described for identifying local molecular sequence features including repeats, dyad symmetry pairings and aligned matches between sequences, while allowing for errors. Specific applications are given to the genomic sequences of the Epstein-Barr virus, Varicella-Zoster virus and the bacteriophages lambda and T7.
SIAM Journal on Discrete Mathematics | 1993
Macdonald S. Morris; Gabriel A. Schachtel; Samuel Karlin
Exact formulas are developed for the probability that a random ordering of a fixed collection of letters contains any specified collection of runs. These results are particularly useful for short sequences and other cases where asymptotic formulas cannot be trusted. Computer programs to evaluate these formulas are available.
Science | 1998
David G. Wang; Jian-Bing Fan; Chia-Jen Siao; Anthony J. Berno; Peter Young; Ron Sapolsky; Ghassan Ghandour; Nancy Perkins; Ellen Winchester; Jessica B. Spencer; Lincoln Stein; Linda Hsie; Thodoros Topaloglou; Earl Hubbell; Elizabeth Robinson; Michael P. Mittmann; Macdonald S. Morris; Naiping Shen; Dan Kilburn; John D. Rioux; Chad Nusbaum; Steve Rozen; Thomas J. Hudson; Robert J. Lipshutz; Mark S. Chee; Eric S. Lander
Archive | 1995
Mark Chee; Maureen T. Cronin; Stephen P. A. Fodor; Xiaohua X. Huang; Earl Hubbell; Robert J. Lipshutz; Peter E. Lobban; Macdonald S. Morris; Edward L. Sheldon
Genome Research | 1998
Kevin L. Gunderson; Xiaohua C. Huang; Macdonald S. Morris; Robert J. Lipshutz; David J. Lockhart; Mark S. Chee
Proceedings of the National Academy of Sciences of the United States of America | 1988
Samuel Karlin; Macdonald S. Morris; Ghassan Ghandour; Ming Ying Leung
Genome Research | 2001
Dirk Walther; Gabor T. Bartha; Macdonald S. Morris
Archive | 2001
Dick Walther; Gabor T. Bartha; Macdonald S. Morris
Archive | 2006
Maureen T. Cronin; Charles Garrett Miyada; Earl Hubbell; Mark Chee; Stephen P. A. Fodor; Xiaohua C. Huang; Robert J. Lipshutz; Peter E. Lobban; Macdonald S. Morris; Edward L. Sheldon