|
J.
Scott Provan
|
|
|
Contact |
|
|
Research
Areas |
|
|
Recent |
A
polynomial-time algorithm to find shortest paths with recurse (2003). Networks
41, 115-125. A topological characterization of protein structure (2007), with Bala Krishnamurthy and Alex Tropsha.
Book chapter in Data Mining in BioMedicine, edited
by Panos M. Paradalos,
Vladimir Boginski, and Alkis
Vazacapoulos, Springer. Enumeration in convex geometries and associated polytopal subdivisions of spheres (2008), with
Louis J. Billera and Samuel K. Hsiao. Discrete and Computational Geometry 39, 123-137. Sudoku: Strategy Versus Structure (2009). The
Mathematical Monthly 116, 702-707. A fast algorithm for computing geodesic distances in tree space (2011), with Megan
Owen. ACM/IEEE Transactions on Computational Biology and Bioinformatics 8 , 2-13
|
|
Fall
Semester 2011 Courses |
|
|
Bio |
|