Glenn Tesler's
Home Page
|
Contact Info Research Interests Resume Publications Courses |
Bioinformatics Lab
CSE Department
UCSD
Research
GRIMM - Genome Rearrangements in Man and Mouse (and other pairwise genome rearrangements)
Two genomes may many genes in common, but the genes may be arranged in a different sequence or be moved between chromosomes. The pairwise genome rearrangement problem is to find an optimal scenario transforming one genome to another via reversals, translocation, fission, and fusion. We provide a web server combining rearrangement algorithms for unichromosomal and multichromosomal genomes, with either signed or unsigned gene data. In each case, it computes the minimum possible number of rearrangement steps, and determines a possible scenario taking this number of steps. This is integrated into a related project MGR for constructing optimal phylogenetic trees with multiple genomes.EULER - Genome assembler
Euler is a new approach to fragment assembly that abandons the classical "overlap - layout - consensus" paradigm that is used in all currently available assembly tools, in favor of a new Eulerian Superpath approach that, for the first time, resolves the problem of repeats in fragment assembly. EULER, in contrast to the Celera assembler, does not mask repeats but uses them instead as a powerful fragment assembly tool. The EULER web server provides an online tool to assemble DNA sequences.
Other Research Interests
Combinatorics, Symmetric Functions, Special Functions, Representation Theory, Posets, Lattices, Tableau Algorithms, Graph Matchings and Walks. See my publication list.
