Controlling size when aligning multiple genomic sequences with duplications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4175 LNBI, Issue , 2006, Pages 138-149

  Hou, Minmei ^a   Berman, Piotr ^a   Zhang, Louxin ^b   Miller, Webb ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT; APPROXIMATION THEORY; GENES; GRAPH THEORY; PROBLEM SOLVING;

COMBINATORIAL EXPLOSION; EVOLUTION; GENOMIC SEQUENCES; HEURISTIC SOLUTIONS; TANDEM GENE CLUSTER;

GENETIC ENGINEERING;

EID: 33750247337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11851561_13     Document Type: Conference Paper

References (23)

1. Berman, P.: Relationship between density and deterministic complexity of NP-complete languages. Lecture Notes in Compute Science 62, 1978 63-71
2. Blanchette, M. et al.: Aligning multiple genomic sequences with the threaded blockset aligner. Genome Research 14, 2004 708-715
3. Cacceta, L., P. Erdos, E.T. Ordman and N.J. Pullman: On the difference between clique numbers of a graph. Ars Combinatoria 19A, 1985 97-106.
4. Cavers, M.: Clique partitions and coverings of graphs 2005 (Masters thesis, University of Waterloo)
5. Cooper, G. M., et al.: Distribution and intensity of constraint in mammalian genomic sequences. Genome Research 15, 2005 901-913.
6. Fitch, W. M.: Distinguishing homologous from analogous proteins. Syst. Zool. 19, 1970 99-113.
7. Fitch, W. M.: Homology, a personal view on some problems. Trends Genet. 16, 2000 227-231.
8. Gramm, J., et al: Data reduction, exact, and heuristic algorithms for clique cover. ALENEX , 2006 86-94.
9. Gregory, D. A., and N.J. Pullman: On a clique covering problem of Orlin. Discrete Math. 41, 1982 97-99.
10. Hall, M. Jr.: A problem in partition, Bull. Amer. Math. Soc. 47, 1941 801-807.
11. Hou, M., et al: Aligning multiple genomic sequences that contain duplications. Manuscript.
12. Hughes, J. R., et al: Annotation of cis-regulatory elements by identification, sub-classification, and functional assessment of multispecies conserved sequences. Proc. Natl. Acad. Sci. USA 102. 2005 9830-9835
13. Kou, L.T., et al: Covering edges by cliques with regard to keyword conflicts and intersection graphs. Communications of the ACM 21(2). 1978 135-139
14. Lund C. and M. Yannakakis, On the hardness of approximation minimization problems. J. Assoc. for Comput. Mach. 41, 1994 961-981.
15. Margulies, E. H., et al. Relationship between evolutionary constraint and genome function in 1% of the human genome. Submitted to Nature.
16. Margulies, E. H., et al. Annotation of the human genome through comparisons of diverse mammalian sequences. Submitted to Genome Research.
17. Orlin, J. Contentment in graph theory: covering graphs with cliques. Indag. Math. 39, 1977 406-424.
18. Pullman, N. J., and A. Donald: Clique coverings of graphs II: complements of cliques. Utilitas Math. 19, 1981 207-213.
19. Pullman, N. J.: Clique coverings of graphs IV: algorithms. SIAM J. on Computing 13, 1984 57-75.
20. Schwartz, S., et al. Human-Mouse Alignments with BLASTZ. Genome Rea. 13(1), 2003 103-107.
21. Siepel, A., et al. Evolutionarily conserved elements in vertebrate, insect;, worm, and yeast genomes. Genome Research 15, 2005 1034-1050.
22. The ENCODE Project Consortium: The ENCODE (ENCyclopedia of DNA Elements) Project. Science 306, 2004 636-640.
23. Wakefield, M. J., P. Maxwell and G. A. Huttley: Vestige: maximum likelihood phylogenetic footprinting. BMC Bioinformatics 6, 2005 130.