Sciweavers

106 search results - page 1 / 22
» Automated generation of heuristics for biological sequence c...
Sort
View
BMCBI
2005
158views more  BMCBI 2005»
13 years 4 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
BMCBI
2005
121views more  BMCBI 2005»
13 years 4 months ago
Automated methods of predicting the function of biological sequences using GO and BLAST
Background: With the exponential increase in genomic sequence data there is a need to develop automated approaches to deducing the biological functions of novel sequences with hig...
Craig E. Jones, Ute Baumann, Alfred L. Brown
BMCBI
2006
100views more  BMCBI 2006»
13 years 5 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
IISWC
2006
IEEE
13 years 11 months ago
Performance Analysis of Sequence Alignment Applications
— Recent advances in molecular biology have led to a continued growth in the biological information generated by the scientific community. Additionally, this area has become a m...
Friman Sánchez, Esther Salamí, Alex ...
CEC
2010
IEEE
13 years 5 months ago
Grammatical rules for the automated construction of heuristics
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...
Germán Terrazas, Natalio Krasnogor