DISCRETE APPLIED MATHEMATICS
Announcing a Second Special Issue on
Computational Molecular Biology
Guest Editors: Sorin Istrail, Pavel Pevzner, Ron Shamir
Submission Deadline: September 15, 1996
``Don't ask [only] what mathematics can do for biology, ask what
biology can do for mathematics.''
Manuscripts are solicited for a special issue of "Discrete
Applied Mathematics" on topics concerning the development of
new combinatorial and algorithmic techniques in computational
molecular biology. This issue will be the second in a series
of special issues of "Discrete Applied Mathematics,"
which publishes papers on the mathematical and algorithmic
foundations of the inherently discrete aspects of computational
The traditional partnership of mathematics and physics
has advanced and enriched both disciplines. In a similar
partnership, mathematics and algorithms are becoming
crucial tools in the rapid advancement of molecular biology.
At the same time, the computational challenges of these
biological disciplines raise exciting new problems in
discrete mathematics and theoretical computer science.
The following is a (non-exhaustive) list of possible topics
of interest for the special issue:
DNA/protein sequence comparison
The response to the first call for papers in this series in
1995 was very strong, and resulted in a high quality volume
which is expected to appear in the Fall 1996.
**The list of accepted papers for the first volume is
appended at the end of this document.**
The guest editors will continue to make every possible effort
to assure the timely completion of a thorough refereeing
process. We expect this second special issue to appear in
the Spring 1998.
Seven (7) hard copies of complete manuscripts should be sent
to any of the guest editors by September 15, 1996.
The submission should be accompanied by an email message
containing only the text (ASCII) of the abstract of the
Authors are encouraged to send also a LaTex or postscript
file of the manuscript via email, to expedite the reviewing
process. This does not replace the need for hard copy
submission. Manuscripts must be prepared according to the
normal submission requirements of Discrete Applied Mathematics,
as described in each issue of the journal.
Further information on the series is
http://www.elsevier.nl/mcs/dam/Menu.html (The Netherlands)
The Guest Editors are:
Sandia National Laboratories
Algorithms and Discrete Mathematics Department
P.O.Box 5800, MS 1110
Albuquerque, NM 87185-5800
scistra at cs.sandia.gov
University of Southern California
Department of Mathematics, DRB 155
Los Angeles, CA 90089-1113
ppevzner at hto.usc.edu
Department of Computer Science
School of Mathematical Sciences
Tel Aviv University
Tel Aviv 69978
shamir at math.tau.ac.il
The List of Accepted Papers for the First Volume:
N. Akkiraju and H. Eddelsbrunner,
"Triangulating the surface of a molecule"
J. Atkins and M. Middendorf,
"On physical mapping and the consecutive ones property
for sparse matrices"
V. Bafna, B. Narayanan and R. Ravi,
"Nonoverlapping local alignments (weighted independent
sets of axis parallel rectangles)"
H. L. Bodlaender and B. de Fluiter,
"On intervalizing k-colored graphs for DNA physical
D. Boneh, C. Dunworth, R. J. Lipton and J. Sgall,
"On the computational power of DNA"
S. Dress, D. Hunson and V. Moulton,
"Analysing and visualizing sequence and distance data
L. A. Goldberg, P. W. Goldberg, C. A. Phillips,
E. Sweedyk and T. Warnow,
"Minimizing phylogenetic number to find good evolutionary
"Polynomial-time algorithm for computing translocation
distance between genomes"
J. Hein, T. Jiang, L. Wang and K. Zhang,
"On the complexity of comparing evolutionary trees"
D. Kandel, Y. Matias, R. Unger and P. M. Winkler,
"Shuffling biological sequences"
J. MacGregor Smith and B. Toppur
"Euclidean Steiner minimal trees, minimum energy
configurations, and the embedding problem of weighted
graphs in $E^3$"
M. Paterson and T. M. Przytycka,
"On the complexity of string folding"
W. Pearson, G. Robins, D. Wrege and T. Zhang
"On the primer selection problem in PCR experiments"
D. Sankoff and J. H. Nadeau
"Conserved synteny as a measure of genomic distance"
T. D. Schneider and D. N. Mastronarde
"Fast multiple alignment of ungapped DNA sequences using
information theory and a relaxation method"
S. S. Skiena and Chen Ting
"Sorting with fixed-length reversals"
M. Vingron and M. Waterman
"Alignment networks and electrical networks"
Z. Zhang, B. He and W. Miller,
"Local multiple alignment via subgraph enumeration"}