Home > Science Seminar > Fall 2005 Seminar Schedule > Sorting by Bounded Length Reversals
The Science Seminar Series: September 22, 2005
Sorting by Bounded Length Reversals
Dr. Sherry Feng
Department of Math & Computer ScienceValdosta State University
Valdosta, GA, 31698
Room 3009 Biology/Chemistry BuildingTime: 4:00 -5:00pm
Sorting is one of the most basic and important problems in computer science. Usually the first algorithm taught in a computer science class
is a sorting algorithm. Efficient and optimal sorting algorithms play a vital role in both theory and in applications. In this talk, we give a brief introduction about sorting by bounded length reversals. We talk about its application in computational biology and music theory, etc.