Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
In this paper, we propose a hierarchical phrase alignment method that aims to acquire translation knowledge. Previous methods utilize the correspondence of sub-trees between bilin...
Background: Predicting the subcellular localization of proteins is important for determining the function of proteins. Previous works focused on predicting protein localization in...
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
Francisco Fernandes, Paulo G. S. da Fonseca, Lu&ia...
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...