32 search results - page 3 / 7 » A fast algorithm for determining the best combination of loc... |
BMCBI
2011
12 years 9 months ago
2011
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...
NLPRS
2001
Springer
13 years 9 months ago
2001
Springer
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...
BMCBI
2005
13 years 5 months ago
2005
Background: Predicting the subcellular localization of proteins is important for determining the function of proteins. Previous works focused on predicting protein localization in...
BMCBI
2011
12 years 9 months ago
2011
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...
BIBE
2008
IEEE
13 years 11 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...