Fast optimal genome tiling with applications to microarray design and homology search

Journal of Computational Biology

Volumn 11, Issue 4, 2004, Pages 766-785

  Herman, Piotr ^a   Bertone, Paul ^b   Dasgupta, Bhaskar ^c   Gerstein, Mark ^b,d   Kao, Ming Yang ^e   Snyder, Michael ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b YALE UNIVERSITY   (United States)

^c 1120 Science and Engineering Offices   (United States)

^d Yale University   (United States)

^e Northwestern University   (United States)

Author keywords

Homology search; Microarray design; Tiling problems

Indexed keywords

DNA FRAGMENT;

ALGORITHM; AMPLICON; ARTICLE; BIOLOGY; DATA ANALYSIS; DNA MICROARRAY; DNA SEQUENCE; GENE NUMBER; GENOME SIZE; HUMAN; MOLECULAR MODEL; NONHUMAN; NUCLEOTIDE REPEAT; PRIORITY JOURNAL; SEQUENCE HOMOLOGY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DNA; GENOMICS; MATHEMATICS; MODELS, GENETIC; OLIGONUCLEOTIDE ARRAY SEQUENCE ANALYSIS; SEQUENCE ALIGNMENT;

EUKARYOTA;

EID: 4544355898     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2004.11.766     Document Type: Article

References (30)

1. Adams, M.D., et al. 2000. The genome sequence of Drosophila melanogaster. Science 287, 2185-2195.
2. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., and Lipman, D.J. 1990. A basic local alignment search tool. J. Mol. Biol. 215, 403-410.
3. The Arabidipsis Genome Initiative. 2000. Analysis of the genome sequence of the flowering plant arabidopsis thaliana. Nature 408, 796-815.
4. Berman, P., DasGupta, B., and Muthukrishnan, S. 2002a. On the exact size of the binary space partitioning of sets of isothetic rectangles with applications. SIAM J. Dis. Math. 15(2), 252-267.
5. Berman, P., DasGupta, B., and Muthukrishnan, S. 2002b. Slice and dice: A simple, improved approximate tiling recipe. Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms, 455-464.
6. Berman, P., DasGupta, B., Muthukrishnan, S., and Ramaswami, S. 2001. Improved approximation algorithms for tiling and packing with rectangles. Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms, 427-436.
7. Bertone, P., Kao, M.Y., Snyder, M., and Gerstein, M. Submitted. The maximum sequence tiling problem with applications to DNA microarray design.
8. The C. elegans Sequencing Consortium. 1998. Genome sequence of the nematode C. elegans: A platform for investigating biology. Science 282, 2012-2018.
9. Cormen, T.H., Leiserson, C.L., and Rivest, R.L. 1990. Introduction to Algorithms, MIT Press, Cambridge, MA.
10. Datar, M., Gionis, A., Indyk, P., and Motwani, R. 2002. Maintaining stream statistics over sliding windows. Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms, 635-644.
11. Hochbaum, D.S. 1997. Approximation Algorithms for NP-Hard Problems, PWS Publishing, Boston, MA.
12. Horak, C.E., Mahajan, M.C., Luscombe, N.M., Gerstein, M., Weissman, S.M., and Snyder, M. 2002. GATA-1 binding sites mapped in the beta-globin locus by using mammalian chip-chip analysis. Proc. Natl. Acad. Sci. USA 995, 2924-2929.
13. International Human Genome Sequencing Consortium. 2001. Initial sequencing and analysis of the human genome. Nature 15, 860-921.
14. Iyer, V.R., Horak, C.E., Scafe, C.S., Botstein, D., Snyder, M., and Brown, P.O. 2001. Genomic binding sites of the yeast cell-cycle transcription factors SBF and MBF. Nature 409, 33-538.
15. Jurka, J. 2000. Repbase update: A database and an electronic journal of repetitive elements. Trends Genet. 9, 418-420.
16. Khanna, S., Muthukrishnan, S., and Paterson, M. 1998. On approximating rectangle tiling and packing. Proc. 9th Ann. ACM-SIAM Symposium on Discrete Algorithms, 384-393.
17. Khanna, S., Muthukrishnan, S., and Skiena, S. 1997. Efficient array partitioning. Proc. 24th Int. Colloquium on Automata, Languages, and Programming, 616-626.
18. Lockhart, D.J., et al. 1996. Expression monitoring by hybridization to high-density oligonucleotide arrays. Nature Biotechnol. 14, 1675-1680.
19. The Mouse Genome Sequencing Consortium. 2002. Initial sequencing and comparative analysis of the mouse genome. Nature 420, 520-562.
20. Mullis, K., Faloona, F., Scharf, S., Saiki, R., Horn, G., and Erlich, H. 1986. Specific enzymatic amplification of DNA in vitro. The polymerase chain reaction. Cold Spring Harbor Symposium in Quantitative Biology 51, 263-273.
21. Muthukrishnan, S., Poosala, V., and Suel, T. 1999. On rectangular partitions in two dimensions: Algorithms, complexity and applications. Proc. 7th Int. Conf. on Database Theory, 236-256.
22. National Center for Biotechnology Information (NCBI). 2002. www.ncbi.nlm.nih.gov.
23. Rinn, J.L., Euskirchen, G., Bertone, P., Martone, R., Luscombe, N.M., Hartman, S., Harrison, P.M., Nelson, K., Miller, P., Gerstein, M., Weissman, S., and Snyder, M. In Press. The transcriptional activity of human chromosome 22. Genes and Development.
24. Ruzzo, W.L., and Tompa, M. 1999. Linear time algorithm for finding all maximal scoring subsequences. Proc. 7th Int. Conf. on Intelligent Systems for Molecular Biology, 234-241.
25. Shalon, D.D., and Smith, P.O.B.S.J. 1996. A DNA microarray system for analyzing complex DNA samples using two-color fluorescent probe hybridization. Genome Res. 6(7), 639-645.
26. Smit, A.F.A., and Green, P. 2002. RepeatMasker. repeatmasker.genome. washington.edu.
27. Smith, A., and Suri, S. 1999. Rectangular tiling in multi-dimensional arrays. Proc. 10th Ann. ACM-SIAM Symposium on Discrete Algorithms, 786-794.
28. Smith, T.F., and Waterman, M.S. 1981. Identification of common molecular subsequences. J. Mol. Biol. 147, 195-197.
29. Venter, J.C. et al. 2001. The sequence of the human genome. Science 291, 1304-1351.
30. Zhang, Z., Berman, P., and Miller, W. 1998. Alignments without low-scoring regions. J. Comp. Biol. 5(2), 197-210.