7:00 pm - 10:00 pm |
Welcome Reception |
8:45 am |
Opening Remarks |
Pavel Pevzner |
RECOMB 1998 Program Committee Chair |
Gary Benson |
RECOMB 1998 Conference Chair |
Sorin Istrail |
RECOMB 1999 Program Committee Chair |
9:00 am |
Distinguished New Technologies Lecture |
10:00 am |
Break |
10:10 am |
Identifying Satellites in Nucleic Acid
Sequences |
10:35 am |
Genome Analysis Using Clusters of |
11:00 am |
Break |
11:15 am |
Non-Adjoining Correlations within Signals in
DNA |
11:40 am |
An Algorithm for Finding Tandem Repeats of Unspecified
Pattern Size |
12:05 pm |
Lunch |
1:30 pm |
Invited Lecture Session |
2:30 pm |
Break |
2:40 pm |
Motif Discovery in Biological Sequences without
Alignment or Enumeration |
3:05 pm |
An Algorithm for Finding Novel Gapped Motifs in DNA
Sequences |
3:30 pm |
A Polyhedral Approach to RNA Sequence Structure
Alignment |
3:55 pm |
Break |
4:10 pm |
Stanislav Ulam Computational Biology Address |
8:00 pm - 10:00 pm |
Business Meeting |
Embassy Ballroom
9:00 am |
Distinguished Conference Lecture |
10:00 am |
Break |
10:10 am |
Assessment of Ab Initio Protein Structure
Prediction |
10:35 am |
A Self-Consistent Field Optimization Approach to |
11:00 am |
Break |
11:15 am |
Modeling DNA Shuffling |
11:40 am |
Multiple Genome Rearrangements |
12:05 pm |
Lunch |
1:30 pm |
Invited Lecture Session |
2:30 pm |
Break |
2:40 pm |
From Four-taxon Trees to Phylogenies: The Case of |
3:05 pm |
On Reconstructing Species Trees From Gene Trees In
Term |
3:30 pm |
The Ordinal Quartet Method |
3:55 pm |
Break
|
4:10 pm |
Invited Lecture Session |
6:00 pm-10:00 pm |
Poster Session
|
Embassy Ballroom
9:00 am |
Invited Lecture Session |
10:00 am |
Break |
10:10 am |
Algorithms for Optical Mapping |
10:35 am |
Estimation for Restriction Sites Observed by
Optical |
11:00 am |
Break |
11:15 am |
Partitioning K Clones: Hardness Results and a
Practical |
11:40 am |
Constructing Maps Using the Span and Inclusion
Relations |
12:05 pm |
Lunch |
1:30 pm |
Invited Lecture Session |
2:30 pm |
Break |
2:40 pm |
How Fast a Protein Chain Can Fold to Its Most Stable
Structure? |
3:00 pm |
Algorithmic Determination of Core Positions in the VL
and |
3:30 pm |
Alignments Without Low-Scoring Regions |
3:55 pm |
Dynamic Programming Alignment Accuracy |
4:20 pm |
Break |
4:30 pm
|
Invited Lecture Session |
Embassy Ballroom
8:30 am |
Protein Folding in the Hydrophobic-Hydrophilic (HP)
Model is NP-Complete |
8:55 am
|
On the Complexity of Protein Folding |
9:20 am
|
A New Method for Modeling and Solving the Protein Fold
Recognition Problem |
9:45 am
|
Optimal Detection of Sequence Similarity by Local
Alignment |
10:10 am |
Break |
10:20 am |
A Formally Exact Method to Numerically Analyze Local
Denaturation |
10:45 am |
The Theoretical Limits of DNA Sequence Discrimination
of Polyamides |
11:10 am |
Maxwell Demon and Topology Simplification by Type II
Topoisomerases |
11:35 am |
A Unified Approach to Word Statistics |
12:00 pm |
Lunch |
1:00 pm |
Regression Analysis of Multiple Protein
Structures |
1:25 pm |
Better Methods for Solving Parsimony and
Compatiblity |
1:50 pm |
Beyond Mutation Matrices: Physical-Chemistry Based |
2:15 pm |
A Structure Based Similarity Measure for Nucleic
Acid |
2:40 pm |
Break |
2:55 pm |
The Hierarchical Organization of Molecular Structure
Computations |
3:20 pm |
Estimaiton of Allele Frequencies From
Color-Multiplexed |
3:45 pm |
Analysis of the Position Dependent Amino Acid
Probabilities |
4:10 pm |
Family-based Homology Detection via Pairwise Sequence
Comparison |
End of RECOMB 98