Brunner, Alayne L., Johnson, David S., Kim, Si Wan, Valouev, Anton, Reddy, Timothy E., Neff, Norma F., ...
To investigate the role of DNA methylation during human development, we developed Methyl-seq, a method that assays DNA methylation at more than 90,000 regions throughout the genome. Performing...
Identifying the Poorest Older Americans (2009)
Fisher, Jonathan D., Johnson, David S., Marchand, Joseph T., Smeeding, Timothy M., Torrey, Barbara B.
Objectives Public policies target a subset of the population defined as poor or needy, but rarely are people poor or needy in the same way. This is particularly true among older adults. This study...
Compressing Rectilinear Pictures and Minimizing Access Control Lists (2008)
Gruia Calinescu, David S. Johnson, Howard Karloff, Katrina Ligett, Jia Wang
We consider a geometric model for the problem of minimizing access control lists (ACLs) in network routers, a model that also has applications to rectilinear picture compression and figure drawing in...
David S. Johnson, Qing Zhou, Kasumi Yagi, Nori Satoh, Wing Wong, Arend Sidow
De novo discovery of a tissue-specific gene
Model-based Analysis of ChIP-Seq (MACS) (2008)
Zhang, Yong, Liu, Tao, Meyer, Clifford A, Eeckhoute, Jérôme, Johnson, David S, Bernstein, Bradley E, ...
Abstract We present Model-based Analysis of ChIP-Seq data, MACS, which analyzes data generated by short read sequencers such as Solexa's Genome Analyzer. MACS empirically models the shift size of...
Published in J. ALGORITHMS 4, 87-100 (1983) The NP-Completeness Column: An Ongoing Guide (2008)
This is the sixth edition of a quarterly column the purpose of which is to provide continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used...
Published in J. ALGORITHMS 3, 89-99 (1982) The NP-Completeness Column: An Ongoing Guide (2008)
This is the second edition of a quarterly column the purpose of which is to provide a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our...
Categories and Subject Descriptors: F.1.3 [Computation by Abstract Devices]: Complexity (2008)
Abstract. This is the 24th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers...
The NP-Completeness Column: The Many Limits on Approximation (2008)
Abstract. This is the 25th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers...
1. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DI- (2008)
William Gasarch, Macs Implementation, Challenge Edited, Michael H. Goldwasser, David S. Johnson, Catherine C. Mcgeoch, ...
implementation where competitors really coded up different algorithms for the problems indicated. 2. Genomic Perl: From Bioinformatics Basics to Working Code by Rex A. Dwyer. Review by Raymond Wan....
Extended Abstract Submission for PLDI’97 Near-optimal Intraprocedural Branch Alignment (2008)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
Systematic evaluation of variability in ChIP-chip experiments using predefined DNA targets. (2008)
Johnson, David S., Li, Wei, Gordon, D. Benjamin, Bhattacharjee, Arindam, Curry, Bo, Ghosh, Jayati, ...
The most widely used method for detecting genome-wide protein-DNA interactions is chromatin immunoprecipitation on tiling microarrays, commonly known as ChIP-chip. Here, we conducted the first...
Systematic evaluation of variability in ChIP-chip experiments using predefined DNA targets (2008)
Johnson, David S., Li, Wei, Gordon, D. Benjamin, Bhattacharjee, Arindam, Curry, Bo, Ghosh, Jayati, ...
The most widely used method for detecting genome-wide protein–DNA interactions is chromatin immunoprecipitation on tiling microarrays, commonly known as ChIP-chip. Here, we conducted the first...
Jill Cirasella, David S. Johnson, Lyle A. Mcgeoch, Weixiong Zhang
The purpose of this paper is to provide the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There are currently three general...
Jill Cirasella, David S. Johnson, Lyle A. Mcgeoch, Weixiong Zhang
Abstract. The purpose of this paper is to provide a preliminary report on the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP)....
Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor
We report on an experimental study of the Gilmore-Gomory cutting-stock heuristic and related LP-based approaches to bin packing, as applied to instances generated according to discrete distributions....
Experimental Analysis of Heuristics for the STSP (2007)
David S. Johnson, Lyle A. McGeoch
In this and the following chapter, we consider what approaches one should take when one is confronted with a real-world application of the TSP. What algorithms should be used under which...
Janos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
In this paper we present a theoretical analysis of the deterministic on-line Sum of Squares algorithm (SS) for bin packing introduced and studied experimentally
Submitted to JACM The Geometric Maximum Traveling Salesman Problem (2007)
Alexander Barvinok, Sandor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
We consider the traveling salesman problem when the cities are points in R
Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor
We report on results of an experimental study of the Gilmore-Gomory cutting-stock heuristic [GG61, GG63] and related LP-based approaches to bin packing, as applied to instances generated according to...
Jill Cirasella, David S. Johnson, Lyle A. Mcgeoch, Weixiong Zhang
Abstract. The purpose of this paper is to provide a preliminary report on the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP)....
Abstract On the Sum-of-Squares Algorithm for Bin Packing (2007)
Janos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Cedex France
In this paper we present a theoretical analysis of the deterministic on-line Sum of Squares algorithm (SS) for bin packing, introduced and studied experimentally in [8], along with several new...
McGeoch , "The Traveling Salesman Problem: A Case Study in Local Optimization (2007)
David S. Johnson, Gregory Gutin, Lyle A. Mcgeoch, Anders Yeo, Weixiong Zhang, Alexei Zverovitch
1 2 THE TRAVELING SALESMAN PROBLEM AND ITS VARIATIONS
This paper presents an informal discussion of issues that arise when one attempts to analyze algorithms experimentally. It is based on lessons learned by the author over the course of more than a...
David L. Applegate, Gruia Calinescu, David S. Johnson, Howard Karloff, Katrina Ligett, Jia Wang
We consider a geometric model for the problem of minimizing access control lists (ACLs) in network routers, a model that also has applications to rectilinear picture compression and figure drawing in...
David L. Applegate, Gruia Calinescu, David S. Johnson, Howard Karloff, Katrina Ligett, Jia Wang
We consider a geometric model for the problem of minimizing access control lists (ACLs) in network routers, a model that also has applications to rectilinear picture compression and figure drawing in...
Compressing rectilinear pictures and minimizing access control lists (2007)
Gruia Calinescu, David S. Johnson, Howard Karloff, Katrina Ligett, Jia Wang
We consider a geometric model for the problem of minimizing access control lists (ACLs) in network routers, a model that also has applications to rectilinear picture compression and figure drawing in...
The np-completeness column: Finding needles in haystacks (2007)
Abstract. This is the 26th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers...
Consumption Mobility in the United States: Evidence from Two Panel Data Sets (2006)
Fisher, Jonathan D, Johnson, David S
This paper examines inequality and mobility using measures of income and consumption. Consumption is claimed to be a better measure of permanent income and thus well-being, but most studies of...
Consumption Mobility in the United States: Evidence from Two Panel Data Sets (2006)
Fisher, Jonathan D, Johnson, David S
This paper examines inequality and mobility using measures of income and consumption. Consumption is claimed to be a better measure of permanent income and thus well-being, but most studies of...
Consumption Mobility in the United States: Evidence from Two Panel Data Sets (2006)
Fisher, Jonathan D, Johnson, David S
This paper examines inequality and mobility using measures of income and consumption. Consumption is claimed to be a better measure of permanent income and thus well-being, but most studies of...
Consumption Mobility in the United States: Evidence from Two Panel Data Sets (2006)
Fisher, Jonathan D, Johnson, David S
This paper examines inequality and mobility using measures of income and consumption. Consumption is claimed to be a better measure of permanent income and thus well-being, but most studies of...
No Place Like Home: Older Adults and Their Housing (2006)
Smeeding, Timothy, Boyle Torrey, Barbara, Fisher, Jonathan, Johnson, David S., Marchand, Joseph
Objectives: This paper employs new data on the consumption and assets of older Americans to investigate recent research findings that older adults do not convert their home equity into income that...
The Retirement Consumption Conundrum: Evidence from a Consumption Survey (2005)
Fisher, Johnathan, Johnson, David S., Marchand, Joseph, Smeeding, Timothy M., Torrey, Barbara Boyle
While the life-cycle hypothesis predicts that consumption remains smooth during the transition from work into retirement, recent studies have shown that consumption declines at retirement. This...
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing (2005)
Csirik, Janos, Johnson, David S., Kenyon, Claire
The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this note, we improve...
Janos Csirik, David S. Johnson, Claire Kenyon
The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this note, we improve...
De novo discovery of a tissue-specific gene regulatory module in a chordate (2005)
Johnson, David S., Zhou, Qing, Yagi, Kasumi, Satoh, Nori, Wong, Wing, Sidow, Arend
We engage the experimental and computational challenges of de novo regulatory module discovery in a complex and largely unstudied metazoan genome. Our analysis is based on the comprehensive...
De novo discovery of a tissue-specific gene regulatory module in a chordate (2005)
Johnson, David S., Zhou, Qing, Yagi, Kasumi, Satoh, Nori, Wong, Wing, Sidow, Arend
We engage the experimental and computational challenges of de novo regulatory module discovery in a complex and largely unstudied metazoan genome. Our analysis is based on the comprehensive...
Johnson, David S., Davidson, Brad, Brown, Christopher D., Smith, William C., Sidow, Arend
We show that sequence comparisons at different levels of resolution can efficiently guide functional analyses of regulatory regions in the ascidians Ciona savignyi and Ciona intestinalis. Sequence...
Johnson, David S., Davidson, Brad, Brown, Christopher D., Smith, William C., Sidow, Arend
We show that sequence comparisons at different levels of resolution can efficiently guide functional analyses of regulatory regions in the ascidians Ciona savignyi and Ciona intestinalis. Sequence...
On the Sum-of-Squares Algorithm for Bin Packing (2002)
Csirik, Janos, Johnson, David S., Kenyon, Claire, Orlin, James B., Shor, Peter W., Weber, Richard R.
In this paper we present a theoretical analysis of the deterministic on-line {\em Sum of Squares} algorithm ($SS$) for bin packing introduced and studied experimentally in \cite{CJK99}, along with...
The Geometric Maximum Traveling Salesman Problem (2002)
Barvinok, Alexander, Fekete, Sandor P., Johnson, David S., Tamir, Arie, Woeginger, Gerhard J., Woodroofe, Russ
We consider the traveling salesman problem when the cities are points in R^d for some fixed d and distances are computed according to geometric distances, determined by some norm. We show that for...
Complexity Results for Bandwidth Minimization. (2002)
Garey,Michael R., Graham,Ronald L., Johnson,David S., Knuth,D. E.
A linear-time algorithm for sparse symmetric matrices which converts a matrix into pentadiagonal form (bandwidth 2), whenever it is possible to do so using simultaneous row and column permutations is...
A theoretician’s guide to the experimental analysis of algorithms (2002)
This paper presents an informal discussion of issues that arise when one attempts to analyze algorithms experimentally. It is based on lessons learned by the author over the course of more than a...
Better Approximation Algorithms for Bin Covering (2001)
Janos Csirik, David S. Johnson, Claire Kenyon
Bin covering takes as input a list of item sizes and places them into bins of unit demand so as to maximize the number of bins whose demand is satisfied. This is in a sense a dual problem to the...
Better Approximation Algorithms for Bin Covering (2001)
Janos Csirik David, David S. Johnson, Claire Kenyon
Bin covering takes as input a list of item sizes and places them into bins of unit demand so as to maximize the number of bins whose demand is satisfied. This is in a sense a dual problem to the...
The asymmetric traveling salesman problem: algorithms, instance generators and tests (2001)
Jill Cirasella, David S. Johnson, Lyle A. Mcgeoch, Weixiong Zhang
Abstract. The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There...
Who Are the Poor Elderly? An Examination Using Alternative Poverty Measures (2000)
Johnson, David S., Smeeding, Timothy M.
According to most accounts the past decade has brought with it tremendous gains in reducing poverty among the elderly, i.e., those persons aged 65 or older. Although official poverty rate for...
On the Sum-of-Squares Algorithm for Bin Packing (2000)
Janos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
In this paper we present a theoretical analysis of the deterministic on-line Sum of Squares algorithm (SS) for bin packing, introduced and studied experimentally in [8], along with several new...
A Self Organizing Bin Packing Heuristic (1999)
Janos Csirik David, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
. This paper reports on experiments with a new on-line heuristic for one-dimensional bin packing whose average-case behavior is surprisingly robust. We restrict attention to the class of...
A Self-Organizing Bin Packing Heuristic (1999)
Janos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
. This paper reports on experiments with a new on-line heuristic for one-dimensional bin packing whose average-case behavior is surprisingly robust. We restrict attention to the class of...
A Self-Organizing Bin Packing Heuristic (1999)
Janos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
This paper reports experiments with a new and surprisingly robust on-line heuristic for one-dimensional bin packing. This new Sum of Squares algorithm (SS) is restricted to the class of...
A Self-Organizing Bin Packing Heuristic (1999)
Janos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
This paper reports experiments with a new and surprisingly robust on-line heuristic for one-dimensional bin packing. This new Sum of Squares algorithm (SS) is restricted to the class of...
Finding Maximum Length Tours Under Polyhedral Norms (1998)
Alexander Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
We consider the traveling salesman problem when the cities are points in IR d for some fixed d and distances are computed according to a polyhedral norm. We show that for any such norm, the problem...
The Maximum Traveling Salesman Problem under Polyhedral Norms (1998)
Alexander Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
. We consider the traveling salesman problem when the cities are points in R d for some fixed d and distances are computed according to a polyhedral norm. We show that for any such norm, the problem...
Polynomial Time Algorithms for Maximization Problems in Spaces With Polyhedral Norms (1998)
Alexander Barvinok, David S. Johnson, Gerhard J. Woeginger, Russel Woodroofe
We discuss geometric special cases of optimization problems on graphs where the n vertices are represented as points in IR d and where the lengths of the edges are measured according to a norm with a...
Simulation Results of the Capacity of Cellular Systems (1997)
Zygmunt J. Haas, Senior Member, Jack H. Winters, David S. Johnson
Abstract — In this paper, we study the capacity of cellular systems with interference-adaptation dynamic channel allocation (DCA) through a set of heuristics that evaluate the required number of...
Near-optimal Intraprocedural Branch Alignment (1997)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
Near-optimal Intraprocedural Branch Alignment (1997)
Cliff Young David, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
Near-Optimal Intraprocedural Branch Alignment (1997)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
Near-Optimal Intraprocedural Branch Alignment (1997)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
Emerging Opportunities for Theoretical Computer Science (1996)
Alfred Aho, David S. Johnson, S. Rao Kosaraju, Catherine C. Mcgeoch, Christos H. Papadimitriou, ...
The principles underlying this report can be summarized as follows: 1. A strong theoretical foundation is vital to computer science. 2. Theory can be enriched by practice. 3. Practice can be enriched...
David S. Johnson, Lyle A. Mcgeoch
This is a preliminary version of a chapter that appeared in the book Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra (eds.), John Wiley and Sons, London, 1997, pp....
David S. Johnson, Lyle A. Mcgeoch
This is a preliminary version of a chapter that appeared in the book Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra (eds.), John Wiley and Sons, London, 1997, pp....
David S. Johnson, Lyle A. Mcgeoch
This is a preliminary version of a chapter that appeared in the book Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra (eds.), John Wiley and Sons, London, 1997, pp....
David S. Johnson, Cecilia R. Aragon, Lyle A. Mcgeoch, Catherine Schevon
This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain well-studied domains of combinatorial optimization. Simulated annealing...
North-Holland ON GENERATING ALL MAXIMAL INDEPENDENT SETS (1987)
David S. Johnson, Mihalis Yannakakis, Christos H. Papadimitriou
We present an algorithm that generates all maximal independent sets of a graph in lexicographic order, with only polynomial delay between the output of two successive independent sets. We also show...
The NP-completeness column: an ongoing guide (1985)
This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our...
The NP-completeness column: an ongoing guide (1985)
This is the 23rd edition of an irregularly appearing column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our...
The NP-completeness column: an ongoing guide (1985)
This is the eleventh edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and...
The NP-completeness column: an ongoing guide (1985)
of Algorithms. When Mike Garey and I published our book Computers and Intractability:
The NP-completeness column: an ongoing guide (1985)
This is the ninth edition of a quarterly column which provides continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and...
The NP-completeness column: an ongoing guide (1985)
This is the sixteenth edition of a quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our book...
The NP-completeness column: an ongoing guide (1985)
This is the thirteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey...
The NP-completeness column: an ongoing guide (1985)
This is the seventeenth edition of a (usually) quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in...
The NP-completeness column: an ongoing guide (1985)
This is the tenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and...
The NP-completeness column: an ongoing guide (1985)
This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey...
The NP-completeness column: an ongoing guide (1985)
This is the fifteenth edition of a quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our book...
The NP-completeness column: an ongoing guide (1985)
This is the eighteenth edition of a (usually) quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our...
The NP-completeness column: an ongoing guide (1985)
This is the eighth edition of a quarterly column the purpose of which is to provide continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used...
The NP-completeness column: an ongoing guide (1985)
This is the twentieth edition of a (usually) quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our...
The NP-completeness column: an ongoing guide (1985)
This is the twelfth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and...
The NP-completeness column: an ongoing guide (1985)
This is the third edition of a quarterly column the purpose of which is to provide a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book...
The NP-completeness column: an ongoing guide (1985)
This is the fifth edition of a quarterly column the purpose of which is to provide continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used...
The NP-completeness column: an ongoing guide (1985)
This is the fourth edition of a quarterly column the purpose of which is to provide continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used...
The NP-completeness column: an ongoing guide (1985)
This is the 22nd edition of an (allegedly) quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our...
The NP-completeness column: an ongoing guide (1985)
This is the 21st edition of a (supposedly) quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our...
The NP-completeness column: an ongoing guide (1985)
This is the seventh edition of a quarterly column the purpose of which is to provide continuing coverage of new developments in the theory of NP-completeness. The presentation is modeled on that used...
Thesis (M.A. in Architecture and Urban Planning)--University of California, Los Angeles, 1980.
Garey, Michael R, Johnson, David S
Incluye bibliografía e índice
Fast algorithms for bin packing (1974)
Janos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
In this paper we present a theoretical analysis of the online Sum-of-Squares algorithm (SS) for bin packing along with several new variants. SS is applicable to any instance of bin packing in which...
Fast algorithms for bin packing (1974)
Janos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
In this paper we present a theoretical analysis of the on-line Sum-of-Squares algorithm (SS) for bin packing along with several new variants. SS is applicable to any instance of bin packing in which...
Look-Ahead Strategies in One Person Games with Randomly Generated Game Trees (1970)
A random method for generated binary trees is presented, ad twp forms of a class of one person games called, "Tree Solitaire" which have such trees as their game trees are defined. After what "look...
Look-Ahead Strategies in One Person Games with Randomly Generated Game Trees (1970)
A random method for generated binary trees is presented, ad twp forms of a class of one person games called, "Tree Solitaire" which have such trees as their game trees are defined. After what "look...
The gamma function and Stirling's formula (1967)
This thesis is not available electronically or by photocopy. Please contact Archives and Special Collections at archives@amherst.edu for more information.
Methods of determination of drop size and distribution in natural fogs. (1949)
Thesis (M.A.)--University of California, Los Angeles - Meteorology, 1949.
The frequency and location of interviewing stations for traffic origins and destinations / (1946)
"A thesis submitted in fulfillment of the requirements of Transportation 113 offered by the Bureau of Highway Traffic, Yale University, New Haven, Connecticut."
Transferring medical images on the world wide web for emergency clinical management: a case report
Johnson, David S, Goel, Rajinder P, Birtwistle, Paul, Hirst, Phil
CLINICAL, MORPHOLOGICAL AND BIOCHEMICAL STUDIES OF A VIRILIZING TUMOR IN THE TESTIS*
Savard, Kenneth, Dorfman, Ralph I., Baggett, Billy, Fielding, Linda L., Engel, Lewis L., McPherson, Harry T., ...
Johnson, David S., Davidson, Brad, Brown, Christopher D., Smith, William C., Sidow, Arend
We show that sequence comparisons at different levels of resolution can efficiently guide functional analyses of regulatory regions in the ascidians Ciona savignyi and Ciona intestinalis. Sequence...
De novo discovery of a tissue-specific gene regulatory module in a chordate
Johnson, David S., Zhou, Qing, Yagi, Kasumi, Satoh, Nori, Wong, Wing, Sidow, Arend
We engage the experimental and computational challenges of de novo regulatory module discovery in a complex and largely unstudied metazoan genome. Our analysis is based on the comprehensive...
Transferring medical images on the world wide web for emergency clinical management: a case report
Johnson, David S, Goel, Rajinder P, Birtwistle, Paul, Hirst, Phil
CLINICAL, MORPHOLOGICAL AND BIOCHEMICAL STUDIES OF A VIRILIZING TUMOR IN THE TESTIS*
Savard, Kenneth, Dorfman, Ralph I., Baggett, Billy, Fielding, Linda L., Engel, Lewis L., McPherson, Harry T., ...
Johnson, David S., Davidson, Brad, Brown, Christopher D., Smith, William C., Sidow, Arend
We show that sequence comparisons at different levels of resolution can efficiently guide functional analyses of regulatory regions in the ascidians Ciona savignyi and Ciona intestinalis. Sequence...
De novo discovery of a tissue-specific gene regulatory module in a chordate
Johnson, David S., Zhou, Qing, Yagi, Kasumi, Satoh, Nori, Wong, Wing, Sidow, Arend
We engage the experimental and computational challenges of de novo regulatory module discovery in a complex and largely unstudied metazoan genome. Our analysis is based on the comprehensive...
No Place Like Home: Older Adults and Their Housing
Timothy Smeeding, Barbara Boyle Torrey, Jonathon Fisher, David S. Johnson
Objectives: This paper employs new data on the consumption and assets of older Americans to investigate recent research findings that older adults do not convert their home equity into income that...
Experimental Total Midzonal Hepatic Necrosis*
Black-Schaffer, Bernard, Johnson, David S., Gobbel, Walter G.
Child Poverty in Wealthy Countries
David S. Johnson, Barbara Boyle Torrey
Review of Child Well-Being, Child Poverty and Child Policy in Modern Nations by Koen Vleminckx and Timothy M. Smeeding and The Dynamics of Child Poverty in Industrialized Countries by Bruce Bradbury,...
Household Expenditure and the Income Tax Rebates of 2001
David S. Johnson, Jonathan A. Parker, Nicholas S. Souleles
Using questions expressly added to the Consumer Expenditure Survey, we estimate the change in consumption expenditures caused by the 2001 federal income tax rebates and test the permanent income...
Household Expenditure and the Income Tax Rebates of 2001
David S. Johnson, Jonathan A. Parker, Nicholas S. Souleles
Under the Economic Growth and Tax Relief Reconciliation Act of 2001, most U.S. taxpayers received a tax rebate between July and September, 2001. The week in which the rebate was mailed was based on...
Household Expenditure and the Income Tax Rebates of 2001
David S. Johnson, Jonathan A. Parker, Nicholas S. Souleles
Under the Economic Growth and Tax Relief Reconciliation Act of 2001, most U.S. taxpayers received a tax rebate between July and September, 2001. The week in which the rebate was mailed was based on...
Systematic evaluation of variability in ChIP-chip experiments using predefined DNA targets
Johnson, David S., Li, Wei, Gordon, D. Benjamin, Bhattacharjee, Arindam, Curry, Bo, Ghosh, Jayati, ...
The most widely used method for detecting genome-wide protein–DNA interactions is chromatin immunoprecipitation on tiling microarrays, commonly known as ChIP-chip. Here, we conducted the first...
The retirement consumption conundrum: Evidence from a consumption survey
Fisher, Jonathan D., Johnson, David S., Marchand, Joseph, Smeeding, Timothy M., Torrey, Barbara Boyle
Recent studies have shown that food consumption declines at retirement. We use broader definitions of consumption from the Consumer Expenditure Survey and find that the so-called retirement...
note: Inequality and the business cycle: A consumption viewpoint
David S. Johnson, Stephanie Shipp
Using Consumer Expenditure Survey data, we obtain summary measures of the distributions of income and consumption for each quarter between 1980 and 1994. We find that the trends in the distribution...
Household Expenditure and the Income Tax Rebates of 2001
David S. Johnson, Jonathan A. Parker, Nicholas S. Souleles
Under the Economic Growth and Tax Relief Reconciliation Act of 2001, most U.S. taxpayers received a tax rebate between July and September, 2001. The week in which the rebate was mailed was based on...
The Retirement Consumption Conundrum: Evidence from a Consumption Survey
Johnathan Fisher, David S. Johnson, Joseph Marchand, Timothy M. Smeeding, Barbara Boyle Torrey
While the life-cycle hypothesis predicts that consumption remains smooth during the transition from work into retirement, recent studies have shown that consumption declines at retirement. This...
Model-based Analysis of ChIP-Seq (MACS)
Zhang, Yong, Liu, Tao, Meyer, Clifford A, Eeckhoute, Jérôme, Johnson, David S, Bernstein, Bradley E, ...
MACS performs model-based analysis of ChIP-Seq data generated by short read sequencers.
Brunner, Alayne L., Johnson, David S., Kim, Si Wan, Valouev, Anton, Reddy, Timothy E., Neff, Norma F., ...
To investigate the role of DNA methylation during human development, we developed Methyl-seq, a method that assays DNA methylation at more than 90,000 regions throughout the genome. Performing...
Consumption Mobility in the United States: Evidence from Two Panel Data Sets
Jonathan D. Fisher, David S. Johnson
This paper examines inequality and mobility using measures of income and consumption. Consumption is claimed to be a better measure of permanent income and thus well-being, but most studies of...
Housing Costs in the CPI: What Are We Measuring?
Joseph G Carson, David S Johnson, Charles Steindel
The treatment of owner-occupied housing in the Consumer Price Index has long been a subject of confusion and consternation. Thus, a session to explore the issues was organized at the National...