IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1003740.html

Algorithms to Model Single Gene, Single Chromosome, and Whole Genome Copy Number Changes Jointly in Tumor Phylogenetics

Author

Listed:
  • Salim Akhter Chowdhury
  • Stanley E Shackney
  • Kerstin Heselmeyer-Haddad
  • Thomas Ried
  • Alejandro A Schäffer
  • Russell Schwartz

Abstract

We present methods to construct phylogenetic models of tumor progression at the cellular level that include copy number changes at the scale of single genes, entire chromosomes, and the whole genome. The methods are designed for data collected by fluorescence in situ hybridization (FISH), an experimental technique especially well suited to characterizing intratumor heterogeneity using counts of probes to genetic regions frequently gained or lost in tumor development. Here, we develop new provably optimal methods for computing an edit distance between the copy number states of two cells given evolution by copy number changes of single probes, all probes on a chromosome, or all probes in the genome. We then apply this theory to develop a practical heuristic algorithm, implemented in publicly available software, for inferring tumor phylogenies on data from potentially hundreds of single cells by this evolutionary model. We demonstrate and validate the methods on simulated data and published FISH data from cervical cancers and breast cancers. Our computational experiments show that the new model and algorithm lead to more parsimonious trees than prior methods for single-tumor phylogenetics and to improved performance on various classification tasks, such as distinguishing primary tumors from metastases obtained from the same patient population.Author Summary: Cancer is an evolutionary system whose growth and development is attributed to aberrations in well-known genes and to cancer-type specific genomic imbalances. Here, we present methods for reconstructing the evolution of individual tumors based on cell-to-cell variations between copy numbers of targeted regions of the genome. The methods are designed to work with fluorescence in situ hybridization (FISH), a technique that allows one to profile copy number changes in potentially thousands of single cells per study. Our work advances the prior art by developing theory and practical algorithms for building evolutionary trees of single tumors that can model gain or loss of genetic regions at the scale of single genes, whole chromosomes, or the entire genome, all common events in tumor evolution. We apply these methods on simulated and real tumor data to demonstrate substantial improvements in tree-building accuracy and in our ability to accurately classify tumors from their inferred evolutionary models. The newly developed algorithms have been released through our publicly available software, FISHtrees.

Suggested Citation

  • Salim Akhter Chowdhury & Stanley E Shackney & Kerstin Heselmeyer-Haddad & Thomas Ried & Alejandro A Schäffer & Russell Schwartz, 2014. "Algorithms to Model Single Gene, Single Chromosome, and Whole Genome Copy Number Changes Jointly in Tumor Phylogenetics," PLOS Computational Biology, Public Library of Science, vol. 10(7), pages 1-19, July.
  • Handle: RePEc:plo:pcbi00:1003740
    DOI: 10.1371/journal.pcbi.1003740
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003740
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1003740&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1003740?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Nicholas Navin & Jude Kendall & Jennifer Troge & Peter Andrews & Linda Rodgers & Jeanne McIndoo & Kerry Cook & Asya Stepansky & Dan Levy & Diane Esposito & Lakshmi Muthuswamy & Alex Krasnitz & W. Rich, 2011. "Tumour evolution inferred by single-cell sequencing," Nature, Nature, vol. 472(7341), pages 90-94, April.
    2. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    3. Hossein Shahrabi Farahani & Jens Lagergren, 2013. "Learning Oncogenetic Networks by Reducing to Mixed Integer Linear Programming," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-8, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. repec:plo:pone00:0158569 is not listed on IDEAS

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Huili Zhang & Rui Du & Kelin Luo & Weitian Tong, 2022. "Learn from history for online bipartite matching," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3611-3640, December.
    2. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    3. Weiqiang Shen & Chuanlin Zhang & Xiaona Zhang & Jinglun Shi, 2019. "A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
    4. Chunmei Liu & Legand Burge & Ajoni Blake, 2010. "Algorithms and time complexity of the request-service problem," Journal of Combinatorial Optimization, Springer, vol. 20(2), pages 180-193, August.
    5. repec:wsi:jeapmx:v:20:y:2018:i:04:n:s021919891850007x is not listed on IDEAS
    6. Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2025. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," Management Science, INFORMS, vol. 71(3), pages 2508-2526, March.
    7. Xiong, Yifan & Li, Ziyan, 2022. "Staffing problems with local network externalities," Economics Letters, Elsevier, vol. 212(C).
    8. Emanuele Malagoli & Luca Di Persio, 2025. "2D Object Detection: A Survey," Mathematics, MDPI, vol. 13(6), pages 1-52, March.
    9. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    10. Weihua Yang & Xu Zhang & Xia Wang, 2024. "The Wasserstein Metric between a Discrete Probability Measure and a Continuous One," Mathematics, MDPI, vol. 12(15), pages 1-13, July.
    11. Ramjattan, Reshawn & Hosein, Nicholas & Hosein, Patrick & Knoesen, Andre, 2022. "Dynamic group formation in an online social network," Technological Forecasting and Social Change, Elsevier, vol. 176(C).
    12. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    13. Tao, Hanqiao & Song, Guopeng & Leus, Roel & Liang, Zhe & Jiang, Jiang, 2026. "Flight test scheduling: A generic model, lower bounds, and iterated local search," European Journal of Operational Research, Elsevier, vol. 328(1), pages 49-63.
    14. Parag A. Pathak & Tayfun Sönmez & M. Utku Ünver & M. Bumin Yenmez, 2024. "Fair Allocation of Vaccines, Ventilators and Antiviral Treatments: Leaving No Ethical Value Behind in Healthcare Rationing," Management Science, INFORMS, vol. 70(6), pages 3999-4036, June.
    15. Miloš Fišar & Ben Greiner & Christoph Huber & Elena Katok & Ali I. Ozkes, 2024. "Reproducibility in Management Science," Management Science, INFORMS, vol. 70(3), pages 1343-1356, March.
    16. Viktor Tihanyi & András Rövid & Viktor Remeli & Zsolt Vincze & Mihály Csonthó & Zsombor Pethő & Mátyás Szalai & Balázs Varga & Aws Khalil & Zsolt Szalay, 2021. "Towards Cooperative Perception Services for ITS: Digital Twin in the Automotive Edge Cloud," Energies, MDPI, vol. 14(18), pages 1-26, September.
    17. Susanna Levantesi & Andrea Nigri & Paolo Pagnottoni & Alessandro Spelta, 2025. "Wasserstein barycenter regression: application to the joint dynamics of regional GDP and life expectancy in Italy," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 109(2), pages 313-336, June.
    18. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    19. Nisse, Nicolas & Salch, Alexandre & Weber, Valentin, 2023. "Recovery of disrupted airline operations using k-maximum matching in graphs," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1061-1072.
    20. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    21. Alfred Galichon & Marc Henry, 2026. "An econometrician's guide to optimal transport," Papers 2604.04227, arXiv.org.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1003740. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.