Demo Data from VLDB 2026 / reviewers in the wild / expert
Karen Moffett
dblp:58/2665
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2002
—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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › phylogenetics › computational phylogenetics
alignment-free phylogeny |
0.0 | 1 | 2002 | Integrated gene and species phylogenies from unaligned whole genome protein sequences · Bioinform. 2002 |
Bioinformatics and computational biology
phylogenetics |
0.0 | 1 | 2002 | Integrated gene and species phylogenies from unaligned whole genome protein sequences · Bioinform. 2002 |
Bioinformatics and computational biology › phylogenetics › phylogenomics
whole-genome phylogeny |
0.0 | 1 | 2002 | Integrated gene and species phylogenies from unaligned whole genome protein sequences · Bioinform. 2002 |
Methods — techniques the papers use, named apart from their topics
tetrapeptide frequency matrix · 0.0singular value decomposition · 0.0pairwise distance · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Integrated gene and species phylogenies from unaligned whole genome protein sequencesabstractAbstract Motivation: Most molecular phylogenies are based on sequence alignments. Consequently, they fail to account for modes of sequence evolution that involve frequent insertions or deletions. Here we present a method for generating accurate gene and species phylogenies from whole genome sequence that makes use of short character string matches not placed within explicit alignments. In this work, the singular value decomposition of a sparse tetrapeptide frequency matrix is used to represent the proteins of organisms uniquely and precisely as vectors in a high-dimensional space. Vectors of this kind can be used to calculate pairwise distance values based on the angle separating the vectors, and the resulting distance values can be used to generate phylogenetic trees. Protein trees so derived can be examined directly for homologous sequences. Alternatively, vectors defining each of the proteins within an organism can be summed to provide a vector representation of the organism, which is then used to generate species trees. Results: Using a large mitochondrial genome dataset, we have produced species trees that are largely in agreement with previously published trees based on the analysis of identical datasets using different methods. These trees also agree well with currently accepted phylogenetic theory. In principle, our method could be used to compare much larger bacterial or nuclear genomes in full molecular detail, ultimately allowing accurate gene and species relationships to be derived from a comprehensive comparison of complete genomes. In contrast to phylogenetic methods based on alignments, sequences that evolve by relative insertion or deletion would tend to remain recognizably similar. Availability: Both the program used to convert properly formatted sequence files into sparse n-gram matrices (aacode3) and the program used to generate PHYLIP compatible pairwise distance matrices from the Singular Value Decomposition (SVD) output (cosdist) are available at http://mama.indstate.edu/user/stuart. The SVD package is available at http://www.netlib.org/svdpack/index.html, and the PHYLIP package is available at http://evolution.genetics.washington.edu/phylip.html. Contact: [email protected] * To whom correspondence should be addressed. Gary W. Stuart, Karen Moffett, Steve Baker |
Bioinform. | 2 |