Arthur L. Delcher

发表

Minimus: a fast, lightweight genome assembler

Mihai Pop, Steven Salzberg, Daniel D. Sommer, 2007, BMC Bioinformatics.

Waterfield's Guide to Computer Software: (Word Processing, Spreadsheet, Database Operating System, and More)

Arthur L. Delcher, 1999 .

A Decision Tree System for Finding Genes in DNA

Steven Salzberg, Kenneth H. Fasman, John Henderson, 1998, J. Comput. Biol..

Efficient Parallel Term Matching

Simon Kasif, Arthur L. Delcher, A. Delcher, 1988 .

Local Consistency in Parallel Constraint Satisfaction Networks

Simon Kasif, Arthur L. Delcher, A. Delcher, 1994, Artif. Intell..

Some results on the computational complexity of symmetric connectionist networks

Simon Kasif, Saibal Banerjee, Gregory F. Sullivan, 1993, Annals of Mathematics and Artificial Intelligence.

Best-Case Results for Nearest-Neighbor Learning

Simon Kasif, Steven Salzberg, David G. Heath, 1995, IEEE Trans. Pattern Anal. Mach. Intell..

Efficient decoding algorithms for generalized hidden Markov model gene finders

Steven Salzberg, William H. Majoros, Arthur L. Delcher, 2005, BMC Bioinformatics.

Comparative genome assembly

Adam M. Phillippy, Mihai Pop, Steven Salzberg, 2004, Briefings Bioinform..

Some Results on the Complexity of Exploiting Data Dependency in Parallel Logic Programs

Simon Kasif, Arthur L. Delcher, 1989, J. Log. Program..

Improved Decision-Making in Game Trees: Recovering from Pathology

Simon Kasif, Arthur L. Delcher, A. Delcher, 1992, AAAI.

A Preprocessor for Shotgun Assembly of Large Genomes

Michael Roberts, James A. Yorke, Brian R. Hunt, 2004, J. Comput. Biol..

Hawkeye and AMOS: visualizing and assessing the quality of genome assemblies

Adam M. Phillippy, Mihai Pop, Steven Salzberg, 2013, Briefings Bioinform..

Identifying bacterial genes and endosymbiont DNA with Glimmer

Steven Salzberg, Arthur L. Delcher, Kirsten A. Bratke, 2007, Bioinform..

Modeling splice sites with Bayes networks

Simon Kasif, Ben Kao, Arthur L. Delcher, 2000, Bioinform..

Chapter 15 Modeling biological data and structure with probabilistic networks

Simon Kasif, Arthur L. Delcher, 1998 .

Logarithmic-Time Updates and Queries in Probabilistic Networks pdf

Simon Kasif, Judea Pearl, Arthur L. Delcher, 1995, UAI.

Term matching on a mesh-connected array of processors

Simon Kasif, Arthur L. Delcher, 2005, Annals of Mathematics and Artificial Intelligence.

Aggressive assembly of pyrosequencing reads with mates

Sergey Koren, Jason R. Miller, Granger G. Sutton, 2008, Bioinform..

An NC Algorithm for Evaluating Monotone Planar Circuits

S. Rao Kosaraju, Arthur L. Delcher, 1995, SIAM J. Comput..

Probabilistic Prediction of Protein Secondary Structure Using Causal Networks (Extended Abstract)

Simon Kasif, William H. Hsu, Arthur L. Delcher, 1993, AAAI.

High-throughput sequence alignment using Graphics Processing Units

Amitabh Varshney, Cole Trapnell, Michael C. Schatz, 2007, BMC Bioinformatics.

Efficient parallel term matching and anti-unification

Simon Kasif, Arthur L. Delcher, 2004, Journal of Automated Reasoning.

A tree-partitioning technique with applications to expression evaluation and term matching

S. Rao Kosaraju, Arthur L. Delcher, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Design of a compartmentalized shotgun assembler for the human genome

Eugene W. Myers, Daniel H. Huson, Knut Reinert, 2001, ISMB.

Large-scale assembly of DNA strings and space-efficient construction of suffix trees

S. Rao Kosaraju, Arthur L. Delcher, 1995, STOC '95.

Optimal Parallel Evaluation of Tree-Structured Computations by Raking

Arthur L. Delcher, S. Rao Kosaraju, A. Delcher, 1988, AWOC.

Protein Secondary-Structure Modeling with Probabilistic Networks

Simon Kasif, William H. Hsu, Arthur L. Delcher, 1993, ISMB.

Large-scale assembly of DNA strings and space-efficient construction of suffix trees

Arthur L. Delcher, S. Rao Kosaraju, 1995, STOC '96.

PROBEmer: a web-based software tool for selecting optimal DNA oligos

Scott J. Emrich, Arthur L. Delcher, Mary Lowe, 2003, Nucleic Acids Res..

Modeling biological data and structure with probabilistic networks1 1* Research supported by NSF Grants IRI-9529227 and IRI-9616254. Both authors also hold appointments with the Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, USA.

Simon Kasif, Arthur L. Delcher, A. Delcher, 1998 .

ON THE COMPLEXITY OF INCREMENTAL PARALLEL COMPUTATIONS IN ARTIFICIAL INTELLIGENCE.

Simon Kasif, Arthur L. Delcher, A. Delcher, 1987 .

Sample display from DisplayMUMs, showing whole-genome alignment of individual shotgun reads (query s

Adam M. Phillippy, Michael E. Smoot, L Steven, 2011 .

MUMmer4: A fast and versatile genome alignment system

Adam M. Phillippy, Steven Salzberg, Guillaume Marçais, 2018, PLoS Comput. Biol..

DAGchainer: a tool for mining segmental genome duplications and synteny

Steven Salzberg, Arthur L. Delcher, Jennifer R. Wortman, 2004, Bioinform..

Learning with a Helpful Teacher

Simon Kasif, Steven Salzberg, David G. Heath, 1991, IJCAI.

Microbial gene identification using interpolated Markov

Simon Kasif, Arthur L. Delcher, Owen White, 1998 .

Sim4cc: a cross-species spliced alignment program

Leming Zhou, Liliana Florea, Arthur L. Delcher, 2009, Nucleic acids research.

Report on the DNA/Biomolecular Computing Workshop∗

Arthur L. Delcher, 1997 .