Data structures and efficient algorithms

1992 ◽  
Keyword(s):  
Data Structures ◽  
Efficient Algorithms

Database Systems in Biology

2013 ◽  
pp. 80-96
Author(s):  
Elisa Pappalardo ◽  
Domenico Cantone
Keyword(s):  
Data Structures ◽  
Large Scale ◽  
High Throughput Sequencing ◽  
Database Systems ◽  
Efficient Algorithms ◽  
Biological Data ◽  
Biological Databases ◽  
Proteomic Data ◽  
Sequencing Technologies ◽  
Object Relational

The successful sequencing of the genoma of various species leads to a great amount of data that need to be managed and analyzed. With the increasing popularity of high-throughput sequencing technologies, such data require the design of flexible scalable, efficient algorithms and enterprise data structures to be manipulated by both biologists and computational scientists; this emerging scenario requires flexible, scalable, efficient algorithms and enterprise data structures. This chapter focuses on the design of large scale database-driven applications for genomic and proteomic data; it is largely believed that biological databases are similar to any standard database-drive application; however, a number of different and increasingly complex challenges arises. In particular, while standard databases are used just to manage information, in biology, they represent a main source for further computational analysis, which frequently focuses on the identification of relations and properties of a network of entities. The analysis starts from the first text-based storage approach and ends with new insights on object relational mapping for biological data.

scholarly journals RECONSTRUCTING A SUFFIX ARRAY

2006 ◽  
Vol 17 (06) ◽  
pp. 1281-1295 ◽  
Author(s):  
FRANTISEK FRANEK ◽  
WILLIAM F. SMYTH
Keyword(s):  
Data Compression ◽  
Data Structures ◽  
Suffix Tree ◽  
Suffix Array ◽  
Efficient Algorithms ◽  
Lexicographical Order ◽  
Time And Space

For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix array should occur in lexicographical order (lexorder). It thus becomes of interest to study possible alternate orderings of the suffixes in these data structures, that may be easier to construct or more efficient to use. In this paper we consider the "reconstruction" of a suffix array based on a given reordering of the alphabet, and we describe simple time- and space-efficient algorithms that accomplish it.

Efficient algorithms and data structures for element-free Galerkin method

2006 ◽  
Vol 42 (4) ◽  
pp. 659-662 ◽  
Author(s):  
G.F. Parreira ◽  
A.R. Fonseca ◽  
A.C. Lisboa ◽  
E.J. Silva ◽  
R.C. Mesquita
Keyword(s):  
Galerkin Method ◽  
Data Structures ◽  
Efficient Algorithms ◽  
Algorithms And Data Structures ◽  
Element Free Galerkin Method ◽  
Element Free Galerkin ◽  
Element Free
Sign in / Sign up

Export Citation Format

Share Document