MES, Computer Science, LoyolaCollege in Maryland, 1984
MA, Mathematics, JohnsHopkinsUniversity, 1977
BA, Mathematics, LoyolaCollege in Maryland, 1973
DNA Sequence Assembly. Working
to develop new algorithms to incorporate all available information (such
as homology to related organisms) and be able to deal with polymorphism in
its output. Results will be part of
the AMOS development effort.
Sequence Comparison. The
goal is to develop algorithms to compare multiple large genomes
efficiently and effectively represent the results.
Statistical Modeling of Sequence Data.
Create tools to model sets of sequences
for use in gene finding (e.g.,
in Glimmer), regulatory
region analysis and sequence classification.
Optimal parallel evaluation of tree-structured computations by
raking. S.R. Kosaraju
and A.L. Delcher.
VLSI Algorithms and Architectures:
Proceedings of 1988 Aegean Workshop on
Computing, 101-110, Springer-Verlag,
1998, LNCS No. 319.
Results for Nearest-Neighbor Learning. S.L. Salzberg, A.L. Delcher, D. Heath, and S. Kasif.
IEEE Transactions on Pattern Analysis
and Machine Intelligence17:6, June 1995, 599-608. (Earlier version,
"Learning with a Helpful Teacher," appeared in the IJCAI-91
Large-scale assembly of DNA strings and space-efficient
construction of suffix trees. S.R. Kosaraju and A.L. Delcher.
Proceedings of the 27th ACM Symposium on
the Theory of Computing, May 1995.
An NC algorithm for evaluating monotone planar circuits.
and S.R. Kosaraju.
Journal on Computing,
24(2):369--375, April 1995.
system that uses interpolated Markov models to find genes in microbial
a system for aligning whole genomes, chromosomes, and other very long DNA
a system for finding maximally discriminatory PCR and hybridization target
probes. Principally developed by
Scott Emrich while at LoyolaCollege.