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

Anton Valouev

dblp:20/4887 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 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
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 › sequence analysis › sequence assembly
assembly editing
0.112006
Refinement of optical map assemblies · Bioinform. 2006
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.112006
Refinement of optical map assemblies · Bioinform. 2006
Bioinformatics and computational biology
genomics
0.112006
Refinement of optical map assemblies · Bioinform. 2006
Bioinformatics and computational biology › sequence analysis
genomic sequence analysis
0.112005
Alignment of Optical Maps · RECOMB 2005
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
optical map alignment
0.112005
Alignment of Optical Maps · RECOMB 2005

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

hidden markov model · 0.1expectation-maximization · 0.1
YearPublicationVenuePosition
2006 Refinement of optical map assemblies
abstract
MOTIVATION: Genomic mutations and variations provide insightful information about the functionality of sequence elements and their association with human diseases. Traditionally, variations are identified through analysis of short DNA sequences, usually shorter than 1000 bp per fragment. Optical maps provide both faster and more cost-efficient means for detecting such differences, because a single map can span over 1 million bp. Optical maps are assembled to cover the whole genome, and the accuracy of assembly is critical. RESULTS: We present a computationally efficient model-based method for improving quality of such assemblies. Our method provides very high accuracy even with moderate coverage (<20 x). We utilize a hidden Markov model to represent the consensus map and use the expectation-Maximization algorithm to drive the refinement process. We also provide quality scores to assess the quality of the finished map. AVAILABILITY: Code is available from www.cmb.usc.edu/people/valouev/
Anton Valouev, Yu Zhang 0002, David C. Schwartz, Michael S. Waterman
Bioinform.1
2005 Alignment of Optical Maps
Anton Valouev, Yu-Chi Liu, David C. Schwartz, Yi Yang 0047, Yu Zhang 0002, Michael S. Waterman
RECOMB1