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

C. D. Livingstone

dblp:98/271 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › multiple sequence alignment
multiple sequence alignment analysis
0.011993
Protein sequence alignments: a strategy for the hierarchical analysis of residue conservation · Comput. Appl. Biosci. 1993
Bioinformatics and computational biology › protein sequence analysis
residue conservation
0.011993
Protein sequence alignments: a strategy for the hierarchical analysis of residue conservation · Comput. Appl. Biosci. 1993
Bioinformatics and computational biology
sequence alignment
0.011993
Protein sequence alignments: a strategy for the hierarchical analysis of residue conservation · Comput. Appl. Biosci. 1993

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

set-based amino acid property description · 0.0
YearPublicationVenuePosition
1993 Protein sequence alignments: a strategy for the hierarchical analysis of residue conservation
abstract
An algorithm is described for the systematic characterization of the physico-chemical properties seen at each position in a multiple protein sequence alignment. The new algorithm allows questions important in the design of mutagenesis experiments to be quickly answered since positions in the alignment that show unusual or interesting residue substitution patterns may be rapidly identified. The strategy is based on a flexible set-based description of amino acid properties, which is used to define the conservation between any group of amino acids. Sequences in the alignment are gathered into subgroups on the basis of sequence similarity, functional, evolutionary or other criteria. All pairs of subgroups are then compared to highlight positions that confer the unique features of each subgroup. The algorithm is encoded in the computer program AMAS (Analysis of Multiply Aligned Sequences) which provides a textual summary of the analysis and an annotated (boxed, shaded and/or coloured) multiple sequence alignment. The algorithm is illustrated by application to an alignment of 67 SH2 domains where patterns of conserved hydrophobic residues that constitute the protein core are highlighted. The analysis of charge conservation across annexin domains identifies the locations at which conserved charges change sign. The algorithm simplifies the analysis of multiple sequence data by condensing the mass of information present, and thus allows the rapid identification of substitutions of structural and functional importance.
C. D. Livingstone, Geoffrey J. Barton
Comput. Appl. Biosci.1