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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Macdonald Morris

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

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

Theory of computation · 1 · 1 first-authorApplied, 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
repeat detection		 0.011988
Algorithms for identifying local molecular sequence features · Comput. Appl. Biosci. 1988
Bioinformatics and computational biology
sequence analysis		 0.011988
Algorithms for identifying local molecular sequence features · Comput. Appl. Biosci. 1988
YearPublicationVenuePosition
1993 Exact Formulas for Multitype Run Statistic in a Random Ordering
abstract
Exact formulas are developed for the probability that a random ordering of a fixed collection of letters contains any specified collection of runs. These results are particularly useful for short sequences and other cases where asymptotic formulas cannot be trusted. Computer programs to evaluate these formulas are available.
Macdonald Morris, Gabriel A. Schachtel, Samuel Karlin
 SIAM J. Discret. Math.1
1988 Algorithms for identifying local molecular sequence features
abstract
Efficient algorithms are described for identifying local molecular sequence features including repeats, dyad symmetry pairings and aligned matches between sequences, while allowing for errors. Specific applications are given to the genomic sequences of the Epstein-Barr virus, Varicella-Zoster virus and the bacteriophages lambda and T7.
Samuel Karlin, Macdonald Morris, G. Ghandour, Ming-Ying Leung
 Comput. Appl. Biosci.2