Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Iain M. Wallace

dblp:14/7029 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2013
0000-0002-9491-7025ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 85% Computational science and engineering · 15%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
multiple sequence alignment
0.122007
Clustal W and Clustal X version 2.0 · Bioinform. 2007
Evaluation of iterative alignment algorithms for multiple alignment · Bioinform. 2005
Bioinformatics and computational biology
sequence analysis
0.112007
Clustal W and Clustal X version 2.0 · Bioinform. 2007
Bioinformatics and computational biology › multiple sequence alignment
iterative alignment
0.112005
Evaluation of iterative alignment algorithms for multiple alignment · Bioinform. 2005
Computational science and engineering › numerical linear algebra
iterative refinement
0.112005
Evaluation of iterative alignment algorithms for multiple alignment · Bioinform. 2005
Bioinformatics and computational biology › multiple sequence alignment
progressive alignment
0.112005
Evaluation of iterative alignment algorithms for multiple alignment · Bioinform. 2005

Methods — techniques the papers use, named apart from their topics

progressive alignment · 0.1iterative optimization · 0.1
YearPublicationVenuePosition
2013 Target Prediction for an Open Access Set of Compounds Active against Mycobacterium tuberculosis
abstract
Mycobacterium tuberculosis, the causative agent of tuberculosis (TB), infects an estimated two billion people worldwide and is the leading cause of mortality due to infectious disease. The development of new anti-TB therapeutics is required, because of the emergence of multi-drug resistance strains as well as co-infection with other pathogens, especially HIV. Recently, the pharmaceutical company GlaxoSmithKline published the results of a high-throughput screen (HTS) of their two million compound library for anti-mycobacterial phenotypes. The screen revealed 776 compounds with significant activity against the M. tuberculosis H37Rv strain, including a subset of 177 prioritized compounds with high potency and low in vitro cytotoxicity. The next major challenge is the identification of the target proteins. Here, we use a computational approach that integrates historical bioassay data, chemical properties and structural comparisons of selected compounds to propose their potential targets in M. tuberculosis. We predicted 139 target--compound links, providing a necessary basis for further studies to characterize the mode of action of these compounds. The results from our analysis, including the predicted structural models, are available to the wider scientific community in the open source mode, to encourage further development of novel TB therapeutics.
Francisco Martínez-Jiménez, George Papadatos, Lun Yang, Iain M. Wallace, Ursula Pieper 0001, Andrej Sali, James R. Brown, John P. Overington, Marc A. Martí-Renom
PLoS Comput. Biol.4
2007 Clustal W and Clustal X version 2.0
abstract
SUMMARY: The Clustal W and Clustal X multiple sequence alignment programs have been completely rewritten in C++. This will facilitate the further development of the alignment algorithms in the future and has allowed proper porting of the programs to the latest versions of Linux, Macintosh and Windows operating systems. AVAILABILITY: The programs can be run on-line from the EBI web server: http://www.ebi.ac.uk/tools/clustalw2. The source code and executables for Windows, Linux and Macintosh computers are available from the EBI ftp site ftp://ftp.ebi.ac.uk/pub/software/clustalw2/
Mark A. Larkin, Gordon Blackshields, Nigel P. Brown, R. Chenna, Paul A. McGettigan, Hamish McWilliam, Franck Valentin, Iain M. Wallace, Andreas Wilm, Rodrigo Lopez, Julie Dawn Thompson, Toby J. Gibson, Desmond G. Higgins
Bioinform.8
2007 Supervised multivariate analysis of sequence groups to identify specificity determining residues
abstract
BACKGROUND: Proteins that evolve from a common ancestor can change functionality over time, and it is important to be able identify residues that cause this change. In this paper we show how a supervised multivariate statistical method, Between Group Analysis (BGA), can be used to identify these residues from families of proteins with different substrate specifities using multiple sequence alignments. RESULTS: We demonstrate the usefulness of this method on three different test cases. Two of these test cases, the Lactate/Malate dehydrogenase family and Nucleotidyl Cyclases, consist of two functional groups. The other family, Serine Proteases consists of three groups. BGA was used to analyse and visualise these three families using two different encoding schemes for the amino acids. CONCLUSION: This overall combination of methods in this paper is powerful and flexible while being computationally very fast and simple. BGA is especially useful because it can be used to analyse any number of functional classes. In the examples we used in this paper, we have only used 2 or 3 classes for demonstration purposes but any number can be used and visualised.
Iain M. Wallace, Desmond G. Higgins
BMC Bioinform.1
2005 Evaluation of iterative alignment algorithms for multiple alignment
abstract
MOTIVATION: Iteration has been used a number of times as an optimization method to produce multiple alignments, either alone or in combination with other methods. Iteration has a great advantage in that it is often very simple both in terms of coding the algorithms and the complexity of the time and memory requirements. In this paper, we systematically test several different iteration strategies by comparing the results on sets of alignment test cases. RESULTS: We tested three schemes where iteration is used to improve an existing alignment. This was found to be remarkably effective and could induce a significant improvement in the accuracy of alignments from most packages. For example the average accuracy of ClustalW was improved by over 6% on the hardest test cases. Iteration was found to be even more powerful when it was directly incorporated into a progressive alignment scheme. Here, iteration was used to improve subalignments at each step of progressive alignment. The beneficial effects of iteration come, in part, from the ability to get round the usual local minimum problem with progressive alignment. This ability can also be used to help reduce the complexity of T-Coffee, without losing accuracy. Alignments can be generated, using T-Coffee, to align subgroups of sequences, which can then be iteratively improved and merged. AVAILABILITY: All of the scripts are freely available on the web at http://www.bioinf.ucd.ie/people/iain/iteration.html CONTACT: [email protected].
Iain M. Wallace, Orla O'Sullivan, Desmond G. Higgins
Bioinform.1