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

P. J. Greaney

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

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

Applied, interdisciplinary, general and emerging computing · 1

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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
sequence compression
0.011992
Natural sequence code representations for compression and rapid searching of human-genome style databases · Comput. Appl. Biosci. 1992
Bioinformatics and computational biology › sequence analysis › sequence similarity search
sequence database search
0.011992
Natural sequence code representations for compression and rapid searching of human-genome style databases · Comput. Appl. Biosci. 1992

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

fast-search algorithms · 0.0bit-level encoding · 0.0
YearPublicationVenuePosition
1992 Natural sequence code representations for compression and rapid searching of human-genome style databases
abstract
Numeric descriptions ('bio-informatic descriptions') of amino acid residues have been developed which will be of value whenever the quality and quantity of information in very large (i.e. 'human genome style') gene and protein sequences is to be compared or manipulated. These codes are as natural as possible by our criteria (the same principles could be used in revision of the criteria). In particular, in storing and searching large amounts of sequence data, natural codes--which relate to the properties of amino acids--can be combined with existing fast-search algorithms but introduce several advantages. The code can be assigned such that sub-selection of bits leads to compressed databases with residues defined less specifically, by classes of properties. The most compressed representation leads to the specification of a residue as polar or non-polar, while the most extended representation used at present also allows specification of, for example, glyco-asparagine and phosphoserine. Preliminary studies on both a supercomputer and smaller machines suggest a 'worst-case' speeding of approximately 4.5-fold. For more intelligent searching, coding extensions mixed with the basic sequence data give the sequence data some of the character of a computer program.
Barry Robson, P. J. Greaney
Comput. Appl. Biosci.2