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

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

Volumn 2452, Issue , 2002, Pages 419-433

  Berman, Piotr ^a   Bertone, Paul ^b   DasGupta, Bhaskar ^c   Gerstein, Mark ^b   Kao, Ming Yang ^d   Snyder, Michael ^b  

^a The Pennsylvania State University   (United States)

^b YALE UNIVERSITY   (United States)

^c 1120 Science and Engineering Offices   (United States)

^d Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOASSAY; BIOINFORMATICS; GENES;

COMPUTATIONAL BIOLOGY; HIGHER DIMENSIONS; HOMOLOGY SEARCH; LONG SEQUENCES; MICROARRAY DESIGNS; NEAR-LINEAR TIME; NP-HARDNESS; SLIDING WINDOW;

APPROXIMATION ALGORITHMS;

EID: 84957007909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45784-4_32     Document Type: Conference Paper

References (28)

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