Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Will D. Gillett"'
Autor:
Yang Zhou, Michael A. Jacobs, Will D. Gillett, Kenneth G. Karol, Elizabeth H. Sims, Rose Ann Cattolico
Publikováno v:
Nova Hedwigia, Beihefte. 136:261-282
Autor:
Joshua D. Smith, Kevin McKernan, Can Alkan, Michael O. Dorschner, Laurakay Bruhn, William F. Donahue, Maynard V. Olson, Eray Tüzün, Nancy F. Hansen, James C. Mullikin, Evan E. Eichler, Tera L. Newman, Lin Chen, Gregory M. Cooper, Joshua M. Korn, Steven A. McCarroll, Eric Haugen, Heather Ebling, N. Alice Yamada, John A. Stamatoyannopoulos, Richard K. Wilson, Ze Cheng, Adrianne Brand, Tina Graves, Nick Sampas, David Altshuler, Nadeem Tusneem, Maika Malig, Peter Tsang, Hillary S. Hayden, Douglas R. Smith, Robert David, Daniel A. Peiffer, Molly Weaver, Wei Tao, Erik Gustafson, Rajinder Kaul, Brian Teague, Deborah A. Nickerson, David J. Saranga, David C. Schwartz, Francesca Antonacci, Troy Zerr, Will D. Gillett, Karen A. Phelps, Jeffrey M. Kidd
Publikováno v:
Nature. 453:56-64
Genetic variation among individual humans occurs on many different scales, ranging from gross alterations in the human karyotype to single nucleotide changes. Here we explore variation on an intermediate scale--particularly insertions, deletions and
Publikováno v:
Journal of Computational Biology. 2:185-205
In the process of constructing high-resolution restriction maps via greedy algorithms, a classical anomaly, known as fragment collapsing, introduces errors into the maps that impedes further map assembly. Fragment collapsing occurs when two different
Publikováno v:
Genomics. 33(3)
An approach to restriction-site mapping and contig building that uses fragment-size data from multiple complete digests of a set of clones that oversample a genomic region is presented. Maps containing both fragment-length data and clone-end data are
Autor:
Will D. Gillett, Eric B. Muehrcke
Publikováno v:
SIGCSE
This paper presents a pedagogical processor model, intended for teaching fundamental concepts about von Neumann machines. A general discussion of the desirable pedagogical properties is given, and a specific one address machine is defined. The machin
Autor:
Will D. Gillett
Publikováno v:
Acta Informatica. 21:183-192
A data encoding scheme involving binary tree encodements is presented and analyzed. A closed-form formula for the number of n-bit legal memory configurations is developed. It is shown that the storage capacity loss due to the use of this scheme is no
Autor:
Sandra Leach, Will D. Gillett
Publikováno v:
Software: Practice and Experience. 8:731-753
This paper addresses two of the problems commonly associated with LR parsing and syntax directed translation schemes, namely grammar stratification and excessively large table size, A solution is discussed which can eliminate stratification of the gr
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Gillett, Will D., Muehrcke, Eric B.
Publikováno v:
Proceedings of the Fourteenth SIGCSE Technical Symposium: Computer Science Education; 2/17/1983, p159-164, 6p
Autor:
Choi, J. W., Kimura, T. D.
Publikováno v:
Proceedings of the 1986 ACM SIGSMALL/PC Symposium: Small Systems; 12/ 1/1986, p72-80, 9p