Near-duplicate detection is important when dealing with large, noisy databases in data mining tasks. In this paper, we present the results of applying the Rank distance and the Smith-Waterman distance, along with more popular string similarity measures such as the Levenshtein distance, together with a disjoint set data structure, for the problem of near-duplicate detection.

Résumé P. Waterman -— Nouvelle approche du prolétariat africain : perspectives, problèmes, dangers. Examen critique des points de vue de Meillassoux et Bagayogo, Sandbrook, Peil, Bromley et Gerry sur la formation des classes sociales et la conscience du prolétariat africain, en particulier de la théorie de 1' « aristocratie ouvrière » comme distincte de, et en conflit avec, les prétendus Lumpen...

We demonstrate the implementation of two important bioinformatic algorithms in the XtremeData XD2000i FSB module using the Intel Accelerator Abstraction Layer (AAL). We have modified SSEARCH35 and NCBI BLAST, industry standard open-source implementations of the Smith-Waterman and BLAST algorithms respectively, to transparently introduce a hardware accelerated option to users.

Whole genome comparison compares (aligns) two genome sequences assuming that analogous characteristics may be found. In this paper, we present an SIMD version of the Smith-Waterman algorithm utilizing Streaming SIMD Extensions (SSE), running on Intel Pentium processors. We compare two approaches, one requiring explicit data dependency handling and one built to automatically handle dependencies ...

This paper presents an approach to detection of protein structural motifs. In our approach, first all protein backbone conformations are converted into character strings using an encoding scheme. Then we use the Smith-Waterman local alignment algorithm to detect common structural motifs. By comparing results with the PROSITE regular expression patterns, our method can detect several motifs whic...

An in-storage implementation of the Smith-Waterman sequence alignment algorithm on a resistive content addressable memory (ReCAM) based storage is proposed. The ReCAM native compare operation is used to find matching basepairs in a fixed number of cycles, regardless of the sequence length. Our in-storage implementation is simulated and compared to state-of-the-art systolic arrays and GPU-based ...

Algorithm and scoring parameters Eg ”best” Two methods for searching protein and DNA Evolution of protein and DNA sequence is done using database. 1. Local comparison i) Ignoring difference-outside most similar region ii) Find similarity between two sequence 2. Gobal Comparison. More appropriate when homology has been established when Building evolutionary trees comparison methods are preferred...

Given two strings S1 = pqaxabcstrqrtp and S2 = xyaxbacsl, the substrings axabcs in S1 and axbacs in S2 are very similar. The problem of finding similar substrings is the local alignment problem. Local alignment is extensively used in computational biology to find regions of similarity in different biological sequences. Similar genetic sequences are identified by computing the local alignment of...

I n Search of Excellence, the 1982 best-selling book by McKinsey partners Tom Peters and Robert Waterman, introduced the mass business audience to the firm’s 7-S model. The model, also influenced by an earlier collaboration between McKinsey and management scholars Richard Pascale and Anthony Athos (The Art of Japanese Management, 1980), describes the seven factors critical for effective strateg...