Peter W. Markstein

Learn More
-Register allocation may be viewed as a graph coloring problem. Each node in the graph stands for a computed quantity that resides in a machine register, and two nodes are connected by an edge if the quantities interfere with each other, that is, if they are simultaneously live at some point in the object program. This approach, though mentioned in the(More)
Metazoan genomes contain vast tracts of cis-regulatory DNA that have been identified typically through tedious functional assays. As a result, it has not been possible to uncover a cis-regulatory code that links primary DNA sequences to gene expression patterns. In an initial effort to determine whether coordinately regulated genes share a common "grammar,"(More)
We present division and square root algorithm for calculations with more bits than are handled by the floating-point hardware. These algorithms avoid the need to multiply two high-precision numbers, speeding up the last iteration by as much as a factor of 10. We also show how to produce the floating-point number closest to the exact result with relatively(More)
Bioinformatics methods have identified enhancers that mediate restricted expression in the Drosophila embryo. However, only a small fraction of the predicted enhancers actually work when tested in vivo. In the present study, co-regulated neurogenic enhancers that are activated by intermediate levels of the Dorsal regulatory gradient are shown to contain(More)
The recent revelation that the human genome contains only ~30,000 genes underscores the importance of gene regulation in generating organismal diversity. Cis-regulatory DNAs, or enhancers, are short stretches of DNA--300 bp to 1,000 bp in length--that control gene expression. This DNA accounts for a substantial fraction of metazoan genomes, but is largely(More)
There is a large body of literature relating to computing system security that includes such issues as statements of problems and requirements for secure systems,'-' research in the design of secure computing efforts to develop techniques for verifying the correctness (and hence impenetrability) of prog r a m ~ , ~ and reports of organized efforts to(More)
This paper describes a study of a class of algorithms for the floating-point divide and square root operations, based on the Newton-Raphson iterative method. The two main goals were: (1) Proving the IEEE correctness of these iterative floating-point algorithms, i.e. compliance with the IEEE-754 standard for binary floating-point operations [1]. The focus(More)