When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
Data compression is one way to alleviate the 1/0bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the ...
Background: The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important. The challenge is to identify subfamilies...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski...
Previous works in change detection on XML documents are not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML...
Erwin Leonardi, Sourav S. Bhowmick, Sanjay Kumar M...
—Past research on temporal databases has primarily focused on state-based representations and on relational query language extensions for such representations. This led to many d...