Title |
Convergent algorithms for protein structural alignment
|
---|---|
Published in |
BMC Bioinformatics, August 2007
|
DOI | 10.1186/1471-2105-8-306 |
Pubmed ID | |
Authors |
Leandro Martínez, Roberto Andreani, José Mario Martínez |
Abstract |
Many algorithms exist for protein structural alignment, based on internal protein coordinates or on explicit superposition of the structures. These methods are usually successful for detecting structural similarities. However, current practical methods are seldom supported by convergence theories. In particular, although the goal of each algorithm is to maximize some scoring function, there is no practical method that theoretically guarantees score maximization. A practical algorithm with solid convergence properties would be useful for the refinement of protein folding maps, and for the development of new scores designed to be correlated with functional similarity. |
Mendeley readers
Geographical breakdown
Country | Count | As % |
---|---|---|
United Kingdom | 3 | 4% |
France | 2 | 3% |
United States | 2 | 3% |
Italy | 1 | 1% |
Spain | 1 | 1% |
Indonesia | 1 | 1% |
Unknown | 65 | 87% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 21 | 28% |
Researcher | 11 | 15% |
Student > Bachelor | 7 | 9% |
Professor | 7 | 9% |
Professor > Associate Professor | 5 | 7% |
Other | 13 | 17% |
Unknown | 11 | 15% |
Readers by discipline | Count | As % |
---|---|---|
Agricultural and Biological Sciences | 23 | 31% |
Chemistry | 12 | 16% |
Biochemistry, Genetics and Molecular Biology | 8 | 11% |
Computer Science | 3 | 4% |
Physics and Astronomy | 3 | 4% |
Other | 13 | 17% |
Unknown | 13 | 17% |