The field of relational database research has developed many database accessing methods for effective data retrieval, e.g. B tree indexing, Bitmap indexing, hash-based join, sort-merge join. These methods are oriented on finding or joining single items (represented by records) that satisfy point or range conditions. However, in the area of data mining research, there is often the need to effect...

The volume of multimedia and complex data (images, videos, audio, time series, DNA sequences, and others) has been growing at a very fast pace. Thus, it is necessary to store in databases many types of data which are not naturally handled by Database Management Systems (DBMSs). Complex data are well-suited to be queried by similarity. Many works addressed techniques for similarity searching, bu...

We have compared commonly used sequence comparison algorithms, scoring matrices, and gap penalties using a method that identifies statistically significant differences in performance. Search sensitivity with either the Smith-Waterman algorithm or FASTA is significantly improved by using modern scoring matrices, such as BLOSUM45-55, and optimized gap penalties instead of the conventional PAM250 ...

The growth factor of a matrix quantifies the amount of potential error growth possible when a linear system is solved using Gaussian elimination with row pivoting. While it is an easy matter [N. J. Higham and D. J. Higham, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 155–164] to construct examples of n × n matrices having any growth factor up to the maximum of 2n−1, the weight of experience and a...