2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989
Hannenhalli S., C. Chappey, Koonin E., Pevzner P.A.
Genome sequence comparison and scenarios for gene rearrangements: a test case. Genomics, 30, 299-311
Bafna V. and Pevzner P.A.
Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution, 12, 239-246
Hannenhalli S., Pevzner P.A.
Transforming cabbage into turnip ( polynomial algorithm for sorting signed permutations by reversals). Proc. of the 27th Annual Symposium on the Theory of Computing (STOC 95), 178-189 Las Vegas, Nevada
Hannenhalli S., Pevzner P.A.
Transforming mice into men ( polynomial algorithm for genomic distance problem). Proc. of the 36 Annual Symposium on Foundations of Computer Science (FOCS 95), Milwaukee, Wisconsin, 581-592
Hannenhalli S., Pevzner P.A.
Towards Computational Theory of Genome Rearrangements. In J. van Leeuwen, (ed.) Computer Science Today: Recent Trends and Developments. Lecture Notes in Computer Science, 1000, 184-202
Pavel A. Pevzner, Michael S. Waterman
Multiple Filtration and Approximate Pattern Matching.
Algorithmica 13(1/2): 135-154 (1995)
Pavel A. Pevzner
DNA Physical Mapping and Alternating Eulerian Cycles in Colored Graphs.
Algorithmica 13(1/2): 77-105 (1995)
Vineet Bafna, Pavel A. Pevzner
Sorting Permutations by Transpositions.
SODA 1995: 614-623