skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: ALGORITHMS OF OPTIMIZING PRODUCTION DNA SEQUENCING

Abstract

No abstract prepared.

Authors:
; ;
Publication Date:
Research Org.:
Los Alamos National Lab., NM (US)
Sponsoring Org.:
US Department of Energy (US)
OSTI Identifier:
784687
Report Number(s):
LA-UR-99-4099
TRN: US200307%%490
DOE Contract Number:
W-7405-ENG-36
Resource Type:
Conference
Resource Relation:
Conference: Conference title not supplied, Conference location not supplied, Conference dates not supplied; Other Information: PBD: 1 Aug 1999
Country of Publication:
United States
Language:
English
Subject:
59 BASIC BIOLOGICAL SCIENCES; ALGORITHMS; DNA SEQUENCING; PRODUCTION

Citation Formats

E. CZABARKA, G. KONJEVOD, and ET AL. ALGORITHMS OF OPTIMIZING PRODUCTION DNA SEQUENCING. United States: N. p., 1999. Web.
E. CZABARKA, G. KONJEVOD, & ET AL. ALGORITHMS OF OPTIMIZING PRODUCTION DNA SEQUENCING. United States.
E. CZABARKA, G. KONJEVOD, and ET AL. 1999. "ALGORITHMS OF OPTIMIZING PRODUCTION DNA SEQUENCING". United States. doi:. https://www.osti.gov/servlets/purl/784687.
@article{osti_784687,
title = {ALGORITHMS OF OPTIMIZING PRODUCTION DNA SEQUENCING},
author = {E. CZABARKA and G. KONJEVOD and ET AL},
abstractNote = {No abstract prepared.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 1999,
month = 8
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most connected component labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among them to reduce the number of neighbors examined. When considering 8-connected components in a 2D image, this can reduce the number of neighbors examined from four to one in many cases. The second strategy uses an array to store the equivalence information among the labels. This replaces the pointer basedmore » rooted trees used to store the same equivalence information. It reduces the memory required and also produces consecutive final labels. Using an array instead of the pointer based rooted trees speeds up the connected component labeling algorithms by a factor of 5 {approx} 100 in our tests on random binary images.« less
  • Techniques for optimizing a static voting type algorithm are presented. Our optimization model is based on minimizing communications cost subject to a given availability constraint. We describe a semi-exhaustive algorithm for solving this model. This algorithm utilizes a novel signature-based method for identifying equivalent vote combinations, and also an efficient algorithm for computing availability. Static algorithms naturally have the advantage of simplicity; however, votes and quorum sizes are not allowed to vary. Therefore, the optimized static algorithm was compared against the available copies method, a dynamic algorithm, to understand the relative performance of the two types of algorithms. We foundmore » that if realistic reconfiguration times are assumed, then no one type of algorithm is uniformly better. The factors that influence relative performance have been identified. The available copies algorithm does better when the update traffic ratio is small, and the variability in the inter-site communications cost is low. 15 refs., 1 fig., 3 tabs.« less
  • The main objectives of data replication are improved availability and reduced communications cost for queries. Maintaining the various copies consistent, however, increases the communications cost incurred by updates. For a given degree of replication, the choice of a specific concurrency control algorithm can have a significant impact on the total communications cost. In this paper we present various models for analyzing and understanding the trade-offs between the potentially opposing objectives of maximum resiliency and minimum communications cost in the context of the quorum consensus class of algorithms. It is argued that an optional vote assignment is one which meets givenmore » resiliency goals and yet incurs the least communications cost compared with all other alternative assignments. A mathematical model for vote assignment is developed, and optimal algorithms are presented. It is demonstrated that significant cost savings can be realized from these approaches. 14 refs., 1 fig., 2 tabs.« less
  • The purpose is to develop a face production cost model for room-and-pillar mining, to integrate the model with SIU-Suboleski production (SSP) modeling software, and to show that combining face production cost with ROM production provides a better indicator for comparing equipment costs. Several production planning scenarios were modeled. An SSP model was developed that incorporates capital, operating, and production costs for each option and calculates an estimate of face production cost on a raw coal basis. 6 refs., 5 figs., 6 tabs.
  • No abstract prepared.