Bioinformatics and Computation

1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018

2000年

Presentation file introducer date
A Faster (Combinatorial) Algorithm for Longest Common Subsequence Jan. 13
An O(n log n) Algorithm for Finding Dissimilar Strings Feb. 15
A Versatile Divide and Conquer Technique for Optimal String Alignment Mar. 28
Multiple Sequence Alignment Using Evolutionary Programming Apr. 18
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem Apr. 26
Protein Multiple Sequence Alignment using Knowledge May 3
Multiple Protein Sequence Alignment Using Double-Dynamic Programming May 17
Multiple sequence alignment with the divide-and-conquer method May 17
Improving the practical Space and Time Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment May 22
Improving the practical Space and Time Efficiency of the Shortest-Paths Approach to SP Multiple Sequence May 22
Progressive Multiple Alignment with Constraints May 31
Finding Approximate Multiple Alignment May 31
Fast multiple alignment of ungapped DNA sequences using information theory and a relaxation method June 21
The Number of Standard and of Effective Multiple Alignments July 5
An investigation of conservation-biased gap-penalties for multiple protein sequence alignment July 5
Improving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment July 7
MSA Aug. 3
An evolutionary approach for finding optimal trees in undirected networks Aug. 24
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees Aug. 24
The Evolution Trees Aug. 31
Evaluation Measures of Multiple Sequence Alignments Aug. 31
Using Traveling Salesman Problem Algorithms for Evolutionary Tree Construction Sept. 14
FRAGMENT ASSEMBLY OF DNA Sept. 26
Using Insertion and Deletion Events for Improving Multiple Sequence Alignments and Building the Corresponding Evolutionary Tree Sept. 26
A Robust Model for Finding Optimal Evolutionary Trees Oct. 3
Physical Mapping of DNA Oct. 3
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees Oct. 3
Near Optimal Multiple Sequence Alignments Using a Traveling Salesman Problem Approach Oct. 17
The Secondary Structure Prediction of RNA Oct. 24
The Complexity of Physical Mapping with Strict Chimerism Nov. 28
DP Algorithms for RNA Secondary Structure Prediction with Pseudoknots Nov. 28
Modeling RNA Secondary Structures Using Tree Grammars Dec. 7
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics) Dec. 12
A Guaranteed Compression Scheme for Repetitive DNA Sequences Dec. 19
GENOME REARRANGEMENTS-1
GENOME REARRANGEMENTS-2


1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018