default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur L. Delcher
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j21]Guillaume Marçais
, Arthur L. Delcher, Adam M. Phillippy, Rachel Coston, Steven L. Salzberg, Aleksey V. Zimin:
MUMmer4: A fast and versatile genome alignment system. PLoS Comput. Biol. 14(1) (2018)- 2014
- [i2]Arthur L. Delcher, Adam J. Grove, Simon Kasif, Judea Pearl:
Logarithmic-Time Updates and Queries in Probabilistic Networks. CoRR abs/1408.1479 (2014) - 2013
- [j20]Michael C. Schatz, Adam M. Phillippy, Daniel D. Sommer, Arthur L. Delcher, Daniela Puiu, Giuseppe Narzisi, Steven L. Salzberg, Mihai Pop:
Hawkeye and AMOS: visualizing and assessing the quality of genome assemblies. Briefings Bioinform. 14(2): 213-224 (2013)
2000 – 2009
- 2008
- [j19]Jason R. Miller, Arthur L. Delcher, Sergey Koren, Eli Venter, Brian Walenz, Anushka Brownley, Justin Johnson, Kelvin Li, Clark M. Mobarry, Granger G. Sutton:
Aggressive assembly of pyrosequencing reads with mates. Bioinform. 24(24): 2818-2824 (2008) - 2007
- [j18]Arthur L. Delcher, Kirsten A. Bratke, Edwin C. Powers, Steven Salzberg:
Identifying bacterial genes and endosymbiont DNA with Glimmer. Bioinform. 23(6): 673-679 (2007) - [j17]Michael C. Schatz, Cole Trapnell, Arthur L. Delcher, Amitabh Varshney:
High-throughput sequence alignment using Graphics Processing Units. BMC Bioinform. 8 (2007) - [j16]Daniel D. Sommer, Arthur L. Delcher, Steven L. Salzberg, Mihai Pop:
Minimus: a fast, lightweight genome assembler. BMC Bioinform. 8 (2007) - 2005
- [j15]William H. Majoros, Mihaela Pertea, Arthur L. Delcher, Steven Salzberg:
Efficient decoding algorithms for generalized hidden Markov model gene finders. BMC Bioinform. 6: 16 (2005) - 2004
- [j14]Mihai Pop, Adam M. Phillippy, Arthur L. Delcher, Steven Salzberg:
Comparative genome assembly. Briefings Bioinform. 5(3): 237-248 (2004) - [j13]Brian J. Haas, Arthur L. Delcher, Jennifer R. Wortman, Steven Salzberg:
DAGchainer: a tool for mining segmental genome duplications and synteny. Bioinform. 20(18): 3643-3646 (2004) - [j12]Michael Roberts, Brian R. Hunt, James A. Yorke, Randall A. Bolanos, Arthur L. Delcher:
A Preprocessor for Shotgun Assembly of Large Genomes. J. Comput. Biol. 11(4): 734-752 (2004) - 2003
- [j11]Scott J. Emrich, Mary Lowe, Arthur L. Delcher:
PROBEmer: a web-based software tool for selecting optimal DNA oligos. Nucleic Acids Res. 31(13): 3746-3750 (2003) - 2001
- [c12]Daniel H. Huson, Knut Reinert, Saul A. Kravitz, Karin A. Remington, Arthur L. Delcher, Ian M. Dew, Michael Flanigan, Aaron L. Halpern, Zhongwu Lai, Clark M. Mobarry, Granger G. Sutton, Eugene W. Myers:
Design of a compartmentalized shotgun assembler for the human genome. ISMB (Supplement of Bioinformatics) 2001: 132-139 - 2000
- [j10]Deyou Cai, Arthur L. Delcher, Ben Kao, Simon Kasif:
Modeling splice sites with Bayes networks. Bioinform. 16(2): 152-158 (2000)
1990 – 1999
- 1998
- [j9]Steven Salzberg, Arthur L. Delcher, Kenneth H. Fasman, John C. Henderson:
A Decision Tree System for Finding Genes in DNA. J. Comput. Biol. 5(4): 667-680 (1998) - 1996
- [j8]Arthur L. Delcher, Adam J. Grove, Simon Kasif, Judea Pearl:
Logarithmic-Time Updates and Queries in Probabilistic Networks. J. Artif. Intell. Res. 4: 37-59 (1996) - [c11]S. Rao Kosaraju, Arthur L. Delcher:
Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction). STOC 1996: 659 - [i1]Arthur L. Delcher, Adam J. Grove, Simon Kasif, Judea Pearl:
Logarithmic-Time Updates and Queries in Probabilistic Networks. CoRR cs.AI/9602102 (1996) - 1995
- [j7]Arthur L. Delcher, Simon Kasif:
Term Matching on a Mesh-Connected Array of Processors. Ann. Math. Artif. Intell. 14(2-4): 177-186 (1995) - [j6]Steven Salzberg, Arthur L. Delcher, David G. Heath, Simon Kasif:
Best-Case Results for Nearest-Neighbor Learning. IEEE Trans. Pattern Anal. Mach. Intell. 17(6): 599-608 (1995) - [j5]Arthur L. Delcher, S. Rao Kosaraju:
An NC Algorithm for Evaluating Monotone Planar Circuits. SIAM J. Comput. 24(2): 369-375 (1995) - [c10]S. Rao Kosaraju, Arthur L. Delcher:
Large-scale assembly of DNA strings and space-efficient construction of suffix trees. STOC 1995: 169-177 - [c9]Arthur L. Delcher, Adam J. Grove, Simon Kasif, Judea Pearl:
Logarithmic-Time Updates and Queries in Probabilistic Networks. UAI 1995: 116-124 - 1994
- [j4]Simon Kasif, Arthur L. Delcher:
Local Consistency in Parallel Constraint Satisfaction Networks. Artif. Intell. 69(1-2): 307-327 (1994) - 1993
- [j3]Simon Kasif, Saibal Banerjee, Arthur L. Delcher, Gregory F. Sullivan:
Some Results on the Computational Complexity of Symmetric Connectionist Networks. Ann. Math. Artif. Intell. 9(3-4): 327-344 (1993) - [c8]Arthur L. Delcher, Simon Kasif, Harry R. Goldberg, William H. Hsu:
Probabilistic Prediction of Protein Secondary Structure Using Causal Networks (Extended Abstract). AAAI 1993: 316-321 - [c7]Arthur L. Delcher, Simon Kasif, Harry R. Goldberg, William H. Hsu:
Protein Secondary-Structure Modeling with Probabilistic Networks. ISMB 1993: 109-117 - [c6]Simon Kasif, Arthur L. Delcher:
Local Consistency in Parallel Constraint-Satisfaction Networks. PPCP 1993: 139-145 - 1992
- [j2]Arthur L. Delcher, Simon Kasif:
Efficient Parallel Term Matching and Anti-Unification. J. Autom. Reason. 9(3): 391-406 (1992) - [c5]Arthur L. Delcher, Simon Kasif:
Improved Decision-Making in Game Trees: Recovering from Pathology. AAAI 1992: 513-518 - 1991
- [c4]Steven Salzberg, Arthur L. Delcher, David G. Heath, Simon Kasif:
Learning with a Helpful Teacher. IJCAI 1991: 705-711 - 1990
- [c3]S. Rao Kosaraju, Arthur L. Delcher:
A Tree-Partitioning Technique with Applications to Expression Evaluation and Term Matching (Extended Abstract). FOCS 1990: 163-172 - [c2]Arthur L. Delcher, Simon Kasif:
Efficient Parallel Term Matching and Anti-Unification. ICLP 1990: 355-369
1980 – 1989
- 1989
- [j1]Arthur L. Delcher, Simon Kasif:
Some Results on the Complexity of Exploiting Data Dependency in Parallel Logic Programs. J. Log. Program. 6(3): 229-241 (1989) - 1988
- [c1]S. Rao Kosaraju, Arthur L. Delcher:
Optimal Parallel Evaluation of Tree-Structured Computations by Raking. AWOC 1988: 101-110
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
