Sciweavers

14 search results - page 1 / 3
» Optimizing substitution matrices by separating score distrib...
Sort
View
BIOINFORMATICS
2004
38views more  BIOINFORMATICS 2004»
13 years 4 months ago
Optimizing substitution matrices by separating score distributions
Yuichiro Hourai, Tatsuya Akutsu, Yutaka Akiyama
BMCBI
2006
120views more  BMCBI 2006»
13 years 5 months ago
Optimizing amino acid substitution matrices with a local alignment kernel
Background: Detecting remote homologies by direct comparison of protein sequences remains a challenging task. We had previously developed a similarity score between sequences, cal...
Hiroto Saigo, Jean-Philippe Vert, Tatsuya Akutsu
BMCBI
2008
130views more  BMCBI 2008»
13 years 5 months ago
A novel series of compositionally biased substitution matrices for comparing Plasmodium proteins
Background: The most common substitution matrices currently used (BLOSUM and PAM) are based on protein sequences with average amino acid distributions, thus they do not represent ...
Kevin Brick, Elisabetta Pizzi
BMCBI
2008
142views more  BMCBI 2008»
13 years 5 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
IJON
2006
96views more  IJON 2006»
13 years 4 months ago
Quasi-optimal EASI algorithm based on the Score Function Difference (SFD)
Equivariant Adaptive Separation via Independence (EASI) is one of the most successful algorithms for Blind Source Separation (BSS). However, the user has to choose nonlinearities,...
Samareh Samadi, Massoud Babaie-Zadeh, Christian Ju...