First Page | Document Content | |
---|---|---|
![]() Date: 2009-07-03 08:57:00Biology Genomics Computational complexity theory Bioinformatics MAX-3SAT Comparative genomics Genome Gene Vertex cover | Add to Reading List |
![]() | Genomes containing Duplicates are Hard to compare (Extended Abstract)? Cedric Chauve1 , Guillaume Fertin2 , Romeo Rizzi3 , and St´ephane Vialette4 ` Montr´eal LaCIM et D´epartement d’Informatique, Universit´e du QuDocID: 1qIfg - View Document |
![]() | Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004DocID: 1mroB - View Document |
![]() | RevCalcDisc_MGnewuch_et_al.dviDocID: 1jjJM - View Document |
![]() | Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert KrauthgamerDocID: 1aKTH - View Document |