An efficient disk based data structure for rapid searching of quantitative two-dimensional gel databases

1993 ◽  
Vol 14 (1) ◽  
pp. 1341-1350 ◽  
Author(s):  
Peter F. Lemkin ◽  
Yecheng Wu ◽  
Kyle Upton
Keyword(s):  
Data Structure ◽  
Two Dimensional

Data-base techniques for multiple two-dimensional polyacrylamide gel electrophoresis analyses.

1980 ◽  
Vol 26 (10) ◽  
pp. 1403-1412 ◽  
Author(s):  
L E Lipkin ◽  
P F Lemkin
Keyword(s):  
Data Structure ◽  
Data Base ◽  
Polyacrylamide Gel Electrophoresis ◽  
Local Alignment ◽  
National Bureau ◽  
Two Dimensional ◽  
Display System ◽  
Interactive Display ◽  
Management Procedures ◽  
Computer Controlled

Abstract Two-dimensional protein electrophoresis can benefit from a powerful set of computer-supported image processing and data structure/management procedures. Detection of quantitative differences is complicated by local inhomogeneities in the polyacrylamide base; biochemical changes and variations in temperature and preparative technique also make the between-gel density and x-y coordinate correspondences quite imprecise. The program presented here provides local alignment and computer-controlled variable “flicker” rates for multiple gels, with use of an interactive display system. Manual spot densitometry, referred to a National Bureau of Standards density wedge, can be complemented by a set of automatic densitometry routines for previously established lists of spots. The ability to establish a set of local landmarks, either by included standards or user identification, provides a basis for automatic n-way gel comparison for subsets or for the entire set of spots. Automatic segmentatin algorithms allow isolatin of spots and separation of touching and partially overlapping regions. Various analytical and statistical facilities are part of the user’s access to the interactively developed data base. The data-structure and image-manipulation techniques developed here allow for user-directed and heuristic comparisons with online presentation of intermediate and final results.

THE QUALITATIVE TREATMENT OF SPATIAL DATA

2007 ◽  
Vol 16 (04) ◽  
pp. 661-682 ◽  
Author(s):  
KAZUKO TAKAHASHI ◽  
TAKAO SUMITOMO
Keyword(s):  
Data Structure ◽  
Spatial Data ◽  
Spatial Reasoning ◽  
Symbolic Representation ◽  
Two Dimensional ◽  
Efficient Treatment ◽  
Dimensional Plane ◽  
Topological Reasoning ◽  
Qualitative Representation ◽  
New Framework

This paper aims at an efficient treatment of spatial data using qualitative representation. We propose a new framework called PLCA, which provides a symbolic representation for the figure in a two-dimensional plane, focusing on the connections between regions. It is based on four simple objects: points(P), lines(L), circuits(C) and areas(A). The entire figure is represented as a combination of these objects. Pairs of areas, circuits or lines never cross. The simple, clear data structure based on objects makes the system feasible and easy to implement. A PLCA expression can be subject to topological reasoning such as judging the connection patterns of areas. We define the operations of area integration and area division on a PLCA expression. These operations preserve the consistency of the expression, and correspond to real actions on the figures. We can add attributes to each object, such as the properties that hold on an area or that an object represents, and make an attributed PLCA. The operations of area integration/division on an attributed PLCA correspond to the alteration of the classification level of objects, and semantic spatial reasoning can be performed on an attributed PLCA.

scholarly journals An efficient data structure for dynamic two-dimensional reconfiguration

2017 ◽  
Vol 75 ◽  
pp. 15-25 ◽  
Author(s):  
Sándor P. Fekete ◽  
Jan-Marc Reinhardt ◽  
Christian Scheffer
Keyword(s):  
Data Structure ◽  
Two Dimensional ◽  
Efficient Data

A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES

2009 ◽  
Vol 19 (01) ◽  
pp. 1-15 ◽  
Author(s):  
YAKOV NEKRICH
Keyword(s):  
Data Structure ◽  
Linear Space ◽  
Unit Cost ◽  
Two Dimensional ◽  
Dynamic Data ◽  
Model Of Computation ◽  
Space Data ◽  
Dynamic Data Structure

In this paper we present a linear space dynamic data structure for two-dimensional orthogonal range reporting and emptiness queries. This data structure answers range reporting queries in time [Formula: see text] for any ε > 0 and k the size of the answer. Our data structure also supports emptiness and one-reporting queries in time O( log n log log n). The model of computation used in this paper is a unit-cost RAM model.

Dog Bites Postman

1998 ◽  
Vol 08 (03) ◽  
pp. 321-342 ◽  
Author(s):  
Olivier Devillers ◽  
Mordecai J. Golin
Keyword(s):  
Data Structure ◽  
Dynamic Structure ◽  
Query Point ◽  
Two Dimensional ◽  
Second Variation ◽  
Post Office ◽  
First Variation ◽  
Post Offices ◽  
The First Variation ◽  
The Second Variation

In this paper, we discuss two variations of the two-dimensional post-office problem that arise when the post-offices are n postmen moving with constant velocities. The first variation addresses the question: given a point q0and time t0who is the nearest postman to q0at time t0? We present a randomized incremental data structure that answers the query in expected O( log2n) time. The second variation views a query point as a dog searching for a postman to bite and finds the postman that a dog running with speed vdcould reach first. While it is quite straightforward to design a data structure for the first problem, designing one for the second appears more difficult. We show that if the dog is quicker than all of the postmen then there is a nice correspondence between the problems. This correspondence will permit us to use the data structure developed for the first problem to solve the second one in O( log2n) time as well.The proposed structure is semi-dynamic, that is the set of postmen can be modified by inserting new postmen. A fully dynamic structure that also supports deletions can be obtained, but in that case the query time becomes O( log3n).

Sign in / Sign up

Export Citation Format

Share Document