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

Clark M. Mobarry

dblp:26/1827 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 3

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
3 papers
Bioinformatics and computational biology · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.122008
Aggressive assembly of pyrosequencing reads with mates · Bioinform. 2008
Efficiently detecting polymorphisms during the fragment assembly process · ISMB 2002
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
hybrid assembly
0.112008
Aggressive assembly of pyrosequencing reads with mates · Bioinform. 2008
Bioinformatics and computational biology › sequence analysis › sequence assembly
whole-genome shotgun assembly
0.112008
Aggressive assembly of pyrosequencing reads with mates · Bioinform. 2008
Bioinformatics and computational biology › comparative genomics › genome comparison
genomic sequence comparison
0.012004
Finding anchors for genomic sequence comparison · RECOMB 2004
Bioinformatics and computational biology › sequence alignment › genome alignment
whole-genome alignment
0.012004
Finding anchors for genomic sequence comparison · RECOMB 2004
Bioinformatics and computational biology
sequence analysis
0.012002
Efficiently detecting polymorphisms during the fragment assembly process · ISMB 2002

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

overlap graph · 0.1statistical framework · 0.0dynamic programming · 0.0chaining algorithm · 0.0graph-based method · 0.0affine sequence alignment · 0.0
YearPublicationVenuePosition
2008 Aggressive assembly of pyrosequencing reads with mates
abstract
MOTIVATION: DNA sequence reads from Sanger and pyrosequencing platforms differ in cost, accuracy, typical coverage, average read length and the variety of available paired-end protocols. Both read types can complement one another in a 'hybrid' approach to whole-genome shotgun sequencing projects, but assembly software must be modified to accommodate their different characteristics. This is true even of pyrosequencing mated and unmated read combinations. Without special modifications, assemblers tuned for homogeneous sequence data may perform poorly on hybrid data. RESULTS: Celera Assembler was modified for combinations of ABI 3730 and 454 FLX reads. The revised pipeline called CABOG (Celera Assembler with the Best Overlap Graph) is robust to homopolymer run length uncertainty, high read coverage and heterogeneous read lengths. In tests on four genomes, it generated the longest contigs among all assemblers tested. It exploited the mate constraints provided by paired-end reads from either platform to build larger contigs and scaffolds, which were validated by comparison to a finished reference sequence. A low rate of contig mis-assembly was detected in some CABOG assemblies, but this was reduced in the presence of sufficient mate pair data. AVAILABILITY: The software is freely available as open-source from http://wgs-assembler.sf.net under the GNU Public License.
Jason R. Miller, Arthur L. Delcher, Sergey Koren, Eli Venter, Brian Walenz, Anushka Brownley, Justin Johnson 0002, Kelvin Li, Clark M. Mobarry, Granger G. Sutton
Bioinform.9
2004 Finding anchors for genomic sequence comparison
abstract
Recent sequencing of the human and other mammalian genomes has brought about the necessity to align them, to identify and characterize their commonalities and differences. Programs that align whole genomes generally use a seed-and-extend technique, starting from exact or near-exact matches and selecting a reliable subset of these, called anchors, and then filling in the remaining portions between the anchors using a combination of local and global alignment algorithms, but their choices for the parameters so far have been primarily heuristic. We present a statistical framework and practical methods for selecting a set of matches that is both sensitive and specific and can constitute a reliable set of anchors for a one-to-one mapping of two genomes from which a whole-genome alignment can be built. Starting from exact matches, we introduce a novel per-base repeat annotation, the $Z$-score, from which noise and repeat filtering conditions are explored. Dynamic programming-based chaining algorithms are also evaluated as context-based filters. We apply the methods described here to the comparison of two progressive assemblies of the human genome, NCBI build 28 and build 34 http://genome.ucsc.edu), and show that a significant portion of the two genomes can be found in selected exact matches, with very limited amount of sequence duplication.
Ross Lippert, Xiaoyue Zhao, Liliana Florea, Clark M. Mobarry, Sorin Istrail
RECOMB4
2002 Efficiently detecting polymorphisms during the fragment assembly process
abstract
Abstract Motivation: Current genomic sequence assemblers assume that the input data is derived from a single, homogeneous source. However, recent whole-genome shotgun sequencing projects have violated this assumption, resulting in input fragments covering the same region of the genome whose sequences differ due to polymorphic variation in the population. While single-nucleotide polymorphisms (SNPs) do not pose a significant problem to state-of-the-art assembly methods, these methods do not handle insertion/deletion (indel) polymorphisms of more than a few bases. Results: This paper describes an efficient method for detecting sequence discrepencies due to polymorphism that avoids resorting to global use of more costly, less stringent affine sequence alignments. Instead, the algorithm uses graph-based methods to determine the small set of fragments involved in each polymorphism and performs more sophisticated alignments only among fragments in that set. Results from the incorporation of this method into the Celera Assembler are reported for the D. melanogaster, H. sapiens, and M. musculus genomes. Availability: The method described herein does not constitute a stand-alone software application, but is laid out in sufficient detail to be implemented as a component of any genomic sequence assembler. Contact: [email protected] Keywords: whole-genome assembly; shotgun sequencing; polymorphism.
Daniel P. Fasulo, Aaron L. Halpern, Ian M. Dew, Clark M. Mobarry
ISMB4