Demo Data from EDBT 2026 / reviewers in the wild / expert
C. Tarnas
dblp:39/2088
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1998
—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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
sequence analysis |
0.0 | 1 | 1998 | Reduced space hidden Markov model training · Bioinform. 1998 |
Bioinformatics and computational biology › multiple sequence alignment
divide-and-conquer alignment |
0.0 | 1 | 1998 | Reduced space hidden Markov model training · Bioinform. 1998 |
Bioinformatics and computational biology
sequence alignment |
0.0 | 1 | 1998 | Reduced space hidden Markov model training · Bioinform. 1998 |
Methods — techniques the papers use, named apart from their topics
forward-backward algorithm · 0.0checkpoint-based reduced space alignment · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Reduced space hidden Markov model trainingabstractMOTIVATION: Complete forward-backward (Baum-Welch) hidden Markov model training cannot take advantage of the linear space, divide-and-conquer sequence alignment algorithms because of the examination of all possible paths rather than the single best path. RESULTS: This paper discusses the implementation and performance of checkpoint-based reduced space sequence alignment in the SAM hidden Markov modeling package. Implementation of the checkpoint algorithm reduced memory usage from O(mn) to O (m square root n) with only a 10% slowdown for small m and n, and vast speed-up for the larger values, such as m = n = 2000, that cause excessive paging on a 96 Mbyte workstation. The results are applicable to other types of dynamic programming. AVAILABILITY: A World-Wide Web server, as well as information on obtaining the Sequence Alignment and Modeling (SAM) software suite, can be found at http://www.cse.ucsc. edu/research/compbio/sam.html. CONTACT: [email protected] C. Tarnas, Richard Hughey |
Bioinform. | 1 |