Skip to main content

Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design

  • Conference paper
  • First Online:
Algorithms in Bioinformatics (WABI 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2452))

Included in the following conference series:

Abstract

Pooled Genomic Indexing (PGI) is a novel method for physical mapping of clones onto known macromolecular sequences. PGI is carried out by pooling arrayed clones, generating shotgun sequence reads from pools and by comparing the reads against a reference sequence. If two reads from two different pools match the reference sequence at a close distance, they are both assigned (deconvoluted) to the clone at the intersection of the two pools and the clone is mapped onto the region of the reference sequence between the two matches. A probabilistic model for PGI is developed, and several pooling schemes are designed and analyzed. The probabilistic model and the pooling schemes are validated in simulated experiments where 625 rat BAC clones and 207 mouse BAC clones are mapped onto homologous human sequence.

Bacterial Artificial Chromosome

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altschul, S.F., Madden, T.L., Schäffer, A.A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res. 25 (1997) 3389–3402

    Article  Google Scholar 

  2. IHGSC: Initial sequencing and analysis of the human genome. Nature 609 (2001) 860–921

    Google Scholar 

  3. Cai, W.W., Chen, R., Gibbs, R.A., Bradley, A.: A clone-array pooled strategy for sequencing large genomes. Genome Res. 11 (2001) 1619–1623

    Article  Google Scholar 

  4. Lander, E.S., Waterman, M.S.: Genomic mapping by fingerprinting random clones: a mathematical analysis. Genomics 2 (1988) 231–239

    Article  Google Scholar 

  5. Bollobás, B.: Extremal graph theory. In Graham, R.L., Grötschel, M., Lovász, L., eds.: Handbook of Combinatorics. Volume II. Elsevier, Amsterdam (1995) 1231–1292

    Google Scholar 

  6. Reiman, I.: Über ein Problem von K. Zarankiewicz. Acta Math. Sci. Hung. 9 (1958) 269–279

    Article  MATH  MathSciNet  Google Scholar 

  7. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. 2nd edn. World Scientific, Singapore (2000)

    Google Scholar 

  8. Bruno, W.J., Knill, E., Balding, D.J., Bruce, D.C., Doggett, N.A., Sawhill, W.W., Stallings, R.L., Whittaker, C.C., Torney, D.C.: Efficient pooling designs for library screening. Genomics 26 (1995) 21–30

    Article  Google Scholar 

  9. Beth, T., Jungnickel, D., Lenz, H.: Design Theory. 2nd edn. Cambridge University Press, UK (1999)

    Google Scholar 

  10. Barillot, E., Lacroix, B., Cohen, D.: Theoretical analysis of library screening using an n-dimensional strategy. Nucleic Acids Res. 19 (1991) 6241–6247

    Article  Google Scholar 

  11. Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory IT-10 (1964) 363–377

    Article  Google Scholar 

  12. D’yachkov, A.G., Macula, Jr., A.J., Rykov, V.V.: New constructions of superimposed codes. IEEE Trans. Inform. Theory IT-46 (2000) 284–290

    Article  MathSciNet  Google Scholar 

  13. Bouck, J., McLeod, M.P., Worley, K., Gibbs, R.A.: The Human Transcript Database: a catalogue of full length cDNA inserts. Bioinformatics 16 (2000) 176–177 〈http://www.hgsc.bcm.tmc.edu/HTDB/〉.

    Article  Google Scholar 

  14. Schuler, G.D.: Pieces of the puzzle: expressed sequence tags and the catalog of human genes. J. Mol. Med. 75 (1997) 694–698 〈http://www.ncbi.nlm.nih.gov/Unigene/〉.

    Article  Google Scholar 

  15. Jurka, J.: Repbase update: a database and an electronic journal of repetitive elements. Trends Genet. 16 (2000) 418–420 〈http://www.girinst.org/〉.

    Article  Google Scholar 

  16. Milosavljevic, A.: DNA sequence similarity recognition by hybridization to short oligomers (1999) U. S. patent 6,001,562.

    Google Scholar 

  17. Andersson, B., Lu, J., Shen, Y., Wentland, M.A., Gibbs, R.A.: Simultaneous shotgun sequencing of multiple cDNA clones. DNA Seq. 7 (1997) 63–70

    Article  Google Scholar 

  18. Yu, W., Andersson, B., Worley, K.C., Muzny, D.M., Ding, Y., Liu, W., Ricafrente, J.Y., Wentland, M.A., Lennon, G., Gibbs, R.A.: Large-scale concatenation cDNA sequencing. Genome Res. 7 (1997) 353–358

    Google Scholar 

  19. Velculescu, V.E., Vogelstein, B., Kinzler, K.W.: Analysing uncharted transcriptomes with SAGE. Trends Genet. 16 (2000) 423–425

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csűrös, M., Milosavljevic, A. (2002). Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design. In: Guigó, R., Gusfield, D. (eds) Algorithms in Bioinformatics. WABI 2002. Lecture Notes in Computer Science, vol 2452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45784-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45784-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44211-0

  • Online ISBN: 978-3-540-45784-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics