StringologyTimes

Data Structures and Algorithms: 2009/3/08-14

1: A Lagrangian Relaxation for the Maximum Stable Set Problem
2: Deposition and Extension Approach to Find Longest Common Subsequence for Multiple Sequences
3: An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
4: Analysis of the Relationships among Longest Common Subsequences, Shortest Common Supersequences and Patterns and its application on Pattern Discovery in Biological Sequences
5: The Fibonacci dimension of a graph