51 search results - page 6 / 11 » Hybrid Methods for the Multileaf Collimator Sequencing Probl... |
BMCBI
2004
13 years 7 months ago
2004
Background: Grouping proteins into sequence-based clusters is a fundamental step in many bioinformatic analyses (e.g., homology-based prediction of structure or function). Standar...
CSB
2005
IEEE
13 years 9 months ago
2005
IEEE
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
CP
2003
Springer
14 years 20 days ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Textural appearance of many real word materials is not static but shows progress in time. If such a progress is spatially and temporally homogeneous these materials can be represe...
BIBE
2008
IEEE
14 years 1 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...