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

John S. Armstrong

dblp:30/5642 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 3

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 · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
0.012000
Sister-Scanning: a Monte Carlo procedure for assessing signals in recombinant sequences · Bioinform. 2000
Bioinformatics and computational biology › phylogenetics › phylogenetic comparative methods
phylogenetic signal
0.012000
Sister-Scanning: a Monte Carlo procedure for assessing signals in recombinant sequences · Bioinform. 2000
Bioinformatics and computational biology › molecular evolution
recombination detection
0.012000
Sister-Scanning: a Monte Carlo procedure for assessing signals in recombinant sequences · Bioinform. 2000
Bioinformatics and computational biology › sequence analysis
DNA sequence analysis
0.011994
SIMPLE34: an improved and enhanced implementation for VAX and Sun computers of the SIMPLE algorithm for analysis of clustered repetitive motifs in nucleotide sequences · Comput. Appl. Biosci. 1994
Bioinformatics and computational biology
sequence analysis
0.011994
SIMPLE34: an improved and enhanced implementation for VAX and Sun computers of the SIMPLE algorithm for analysis of clustered repetitive motifs in nucleotide sequences · Comput. Appl. Biosci. 1994

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

monte carlo randomization · 0.0
YearPublicationVenuePosition
2005 Individual sequences in large sets of gene sequences may be distinguished efficiently by combinations of shared sub-sequences
abstract
BACKGROUND: Most current DNA diagnostic tests for identifying organisms use specific oligonucleotide probes that are complementary in sequence to, and hence only hybridize with the DNA of one target species. By contrast, in traditional taxonomy, specimens are usually identified by 'dichotomous keys' that use combinations of characters shared by different members of the target set. Using one specific character for each target is the least efficient strategy for identification. Using combinations of shared bisectionally-distributed characters is much more efficient, and this strategy is most efficient when they separate the targets in a progressively binary way. RESULTS: We have developed a practical method for finding minimal sets of sub-sequences that identify individual sequences, and could be targeted by combinations of probes, so that the efficient strategy of traditional taxonomic identification could be used in DNA diagnosis. The sizes of minimal sub-sequence sets depended mostly on sequence diversity and sub-sequence length and interactions between these parameters. We found that 201 distinct cytochrome oxidase subunit-1 (CO1) genes from moths (Lepidoptera) were distinguished using only 15 sub-sequences 20 nucleotides long, whereas only 8-10 sub-sequences 6-10 nucleotides long were required to distinguish the CO1 genes of 92 species from the 9 largest orders of insects. CONCLUSION: The presence/absence of sub-sequences in a set of gene sequences can be used like the questions in a traditional dichotomous taxonomic key; hybridisation probes complementary to such sub-sequences should provide a very efficient means for identifying individual species, subtypes or genotypes. Sequence diversity and sub-sequence length are the major factors that determine the numbers of distinguishing sub-sequences in any set of sequences.
Mark J. Gibbs, John S. Armstrong, Adrian J. Gibbs
BMC Bioinform.2
2000 Sister-Scanning: a Monte Carlo procedure for assessing signals in recombinant sequences
abstract
Abstract Motivation: To devise a method that, unlike available methods, directly measures variations in phylogenetic signals in gene sequences that result from recombination, tests the significance of the signal variations and distinguishes misleading signals. Results: We have developed a method, that we call ‘sister-scanning’, for assessing phylogenetic and compositional signals in the various patterns of identity that occur between four nucleotide sequences. A Monte Carlo randomization is done for all columns (positions) within a window and \batchmode \documentclass[fleqn,10pt,legalpaper]{article} \usepackage{amssymb} \usepackage{amsfonts} \usepackage{amsmath} \pagestyle{empty} \begin{document} \(Z\) \end{document}-scores are obtained for four real sequences or three real sequences with an outlier that is also randomized. The usefulness of the approach is demonstrated using tobamovirus and luteovirus sequences. Contradictory phylogenetic signals were distinguished in both datasets, as were regions of sequence that contained no clear signal or potentially misleading signals related to compositional similarities. In the tobamovirus dataset, contradictory phylogenetic signals were separated by coding sequences up to a kilobase long that contained no clear signal. Our re-analysis of this dataset using sister-scanning also yielded the first evidence known to us of an inter-species recombination site within a viral RNA-dependent RNA polymerase gene together with evidence of an unusual pattern of conservation in the three codon positions. Availability: A program package, SiScan, for use under MS-DOS can be downloaded from http://life.anu.edu.au/with test data and instructions. Contact: [email protected]; [email protected]; [email protected] * To whom correspondence should be addressed.
Mark J. Gibbs, John S. Armstrong, Adrian J. Gibbs
Bioinform.2
1994 SIMPLE34: an improved and enhanced implementation for VAX and Sun computers of the SIMPLE algorithm for analysis of clustered repetitive motifs in nucleotide sequences
abstract
SIMPLE34 is an improved and enhanced version of SIMPLE for Vax and SunOS systems. It now provides a length-independent measure of the overall level of tri- and tetranucleotide motif clustering within nucleotide sequences and its significant deviation from random expectation. It now also provides information on tri- and tetranucleotide motifs showing higher levels of clustering than would be expected in random sequences. Sequence simplicity of test sequences can be judged with respect to random sequences generated on the basis of base composition, positional base composition or doublet frequency. These options can be used to investigate factors resulting in sequence simplicity.
John M. Hancock, John S. Armstrong
Comput. Appl. Biosci.2