Complexity and algorithms for copy-number evolution problems

Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithms for molecular biology Ročník 12; číslo 1; s. 13 - 11
Hlavní autoři:	El-Kebir, Mohammed, Raphael, Benjamin J., Shamir, Ron, Sharan, Roded, Zaccaria, Simone, Zehavi, Meirav, Zeira, Ron
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London BioMed Central 16.05.2017 Springer Nature B.V BMC
Témata:	Aberration Algorithms Bioinformatics Biomedical and Life Sciences Cancer Cellular and Medical Topics Children Chromosomes Complexity Computational Biology/Bioinformatics Computer simulation Computing time Copy number Copy-number variant Diagnosis Dynamic programming Evolutionary algorithms Genes Graph theory Leaves Life Sciences Maximum parsimony Mutation Phylogenetics Phylogeny Physiological Prognosis Quality assessment Selected papers from WABI 2016 Somatic mutation Somatic mutation Phylogeny Maximum parsimony Copy-number variant Cancer
ISSN:	1748-7188, 1748-7188
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome’s copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis. Results We model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile a to b by the minimum number of events needed to transform a into b . Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given k profiles, the second, more general problem, seeks a phylogenetic tree, whose k leaves are labeled by the k given profiles and whose internal vertices are labeled by ancestral profiles such that the sum of edge distances is minimum. Conclusions For the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances. Availability https://github.com/raphael-group/CNT-ILP
AbstractList	Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome’s copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis. Results We model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile a to b by the minimum number of events needed to transform a into b . Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given k profiles, the second, more general problem, seeks a phylogenetic tree, whose k leaves are labeled by the k given profiles and whose internal vertices are labeled by ancestral profiles such that the sum of edge distances is minimum. Conclusions For the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances. Availability https://github.com/raphael-group/CNT-ILP Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome's copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis.BACKGROUNDCancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome's copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis.We model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile [Formula: see text] to [Formula: see text] by the minimum number of events needed to transform [Formula: see text] into [Formula: see text]. Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given k profiles, the second, more general problem, seeks a phylogenetic tree, whose k leaves are labeled by the k given profiles and whose internal vertices are labeled by ancestral profiles such that the sum of edge distances is minimum.RESULTSWe model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile [Formula: see text] to [Formula: see text] by the minimum number of events needed to transform [Formula: see text] into [Formula: see text]. Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given k profiles, the second, more general problem, seeks a phylogenetic tree, whose k leaves are labeled by the k given profiles and whose internal vertices are labeled by ancestral profiles such that the sum of edge distances is minimum.For the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances.CONCLUSIONSFor the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances.https://github.com/raphael-group/CNT-ILP.AVAILABILITYhttps://github.com/raphael-group/CNT-ILP. Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome’s copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis. Results We model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile $\mathbf {a}$ to $\mathbf {b}$ by the minimum number of events needed to transform $\mathbf {a}$ into $\mathbf {b}$. Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given k profiles, the second, more general problem, seeks a phylogenetic tree, whose k leaves are labeled by the k given profiles and whose internal vertices are labeled by ancestral profiles such that the sum of edge distances is minimum. Conclusions For the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances. Availability https://github.com/raphael-group/CNT-ILP Abstract Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome’s copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis. Results We model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile $$\mathbf {a}$$ a to $$\mathbf {b}$$ b by the minimum number of events needed to transform $$\mathbf {a}$$ a into $$\mathbf {b}$$ b . Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given k profiles, the second, more general problem, seeks a phylogenetic tree, whose k leaves are labeled by the k given profiles and whose internal vertices are labeled by ancestral profiles such that the sum of edge distances is minimum. Conclusions For the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances. Availability https://github.com/raphael-group/CNT-ILP Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome's copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis. We model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile [Formula: see text] to [Formula: see text] by the minimum number of events needed to transform [Formula: see text] into [Formula: see text]. Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given profiles, the second, more general problem, seeks a phylogenetic tree, whose leaves are labeled by the given profiles and whose internal vertices are labeled by ancestral profiles such that the sum of edge distances is minimum. For the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances. https://github.com/raphael-group/CNT-ILP.
ArticleNumber	13
Author	Zeira, Ron Raphael, Benjamin J. Sharan, Roded El-Kebir, Mohammed Zaccaria, Simone Zehavi, Meirav Shamir, Ron
Author_xml	– sequence: 1 givenname: Mohammed surname: El-Kebir fullname: El-Kebir, Mohammed organization: Department of Computer Science, Princeton University, Department of Computer Science, Center for Computational Molecular Biology, Brown University – sequence: 2 givenname: Benjamin J. surname: Raphael fullname: Raphael, Benjamin J. email: braphael@princeton.edu organization: Department of Computer Science, Princeton University, Department of Computer Science, Center for Computational Molecular Biology, Brown University – sequence: 3 givenname: Ron surname: Shamir fullname: Shamir, Ron email: rshamir@post.tau.ac.il organization: School of Computer Science, Tel Aviv University – sequence: 4 givenname: Roded surname: Sharan fullname: Sharan, Roded organization: School of Computer Science, Tel Aviv University – sequence: 5 givenname: Simone surname: Zaccaria fullname: Zaccaria, Simone organization: Department of Computer Science, Princeton University, Department of Computer Science, Center for Computational Molecular Biology, Brown University, Dipartimento di Informatica Sistemistica e Comunicazione (DISCo), Univ. degli Studi di Milano-Bicocca – sequence: 6 givenname: Meirav surname: Zehavi fullname: Zehavi, Meirav organization: School of Computer Science, Tel Aviv University – sequence: 7 givenname: Ron surname: Zeira fullname: Zeira, Ron organization: School of Computer Science, Tel Aviv University
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/28515774$$D View this record in MEDLINE/PubMed
BookMark	eNp9kk2L1TAYhYuMOB_6A9xIwY2b6vvmo0lABLmMOjDgRtchadI7vbTJNWkH77-3nc7InQFdhITknIdD3nNenIQYfFG8RniPKOsPGSkgrwDFvIBW5FlxhoLJSqCUJ0fn0-I85x0A4xToi-KUSI5cCHZWfNzEYd_73914KE1wpem3MXXjzZDLNqayiftDFabB-lT629hPYxdDuU_R9n7IL4vnremzf3W_XxQ_v1z-2Hyrrr9_vdp8vq4aTuux8h5IK1tDamKZR6iVYRJVbQVFA8pC2ypvDDjrGlIb5pq6RWOZpFwaAEoviquV66LZ6X3qBpMOOppO313EtNUmjV3Te90KJxEQlUXOvPEWmIPaUcWdck7AzPq0svaTHbxrfBiT6R9BH7-E7kZv463mjFIEMgPe3QNS_DX5POqhy43vexN8nLJGBYBEMbXkfvtEuotTCvNXLSomuCSwJHpznOhvlIchzQKxCpoUc06-1U03mmUSc8Cu1wh6qYNe66DnOuilDnrJik-cD_D_ecjqybM2bH06Cv1P0x9JZ8ay
CitedBy_id	crossref_primary_10_1186_s13059_021_02291_5 crossref_primary_10_1038_s41467_020_17967_y crossref_primary_10_1038_s41586_025_09398_w crossref_primary_10_1016_j_ebiom_2022_104169 crossref_primary_10_1038_s41586_023_05783_5 crossref_primary_10_1089_cmb_2017_0253 crossref_primary_10_3389_fgene_2024_1383676 crossref_primary_10_1371_journal_pcbi_1011590 crossref_primary_10_1016_j_cels_2020_04_001 crossref_primary_10_1016_j_cpt_2024_04_003 crossref_primary_10_1038_s41587_020_0661_6 crossref_primary_10_1093_bioinformatics_btaf072 crossref_primary_10_26508_lsa_202402923 crossref_primary_10_1038_s41598_024_67842_9 crossref_primary_10_1371_journal_pcbi_1008012 crossref_primary_10_1186_s13015_022_00209_9 crossref_primary_10_1016_j_ebiom_2020_102793
Cites_doi	10.1038/ng.2762 10.1186/s13059-015-0592-6 10.1371/journal.pcbi.1003740 10.1007/978-3-662-48221-6_8 10.1038/bjc.2012.581 10.1371/journal.pcbi.1003535 10.1093/bioinformatics/btv261 10.1093/bioinformatics/btv003 10.1016/0025-5564(81)90043-2 10.1016/S0196-8858(82)80004-3 10.1186/1471-2105-15-35 10.1186/s13059-015-0647-8 10.1126/science.959840 10.1007/978-3-319-43681-4_11 10.1038/ng.3214
ContentType	Journal Article
Copyright	The Author(s) 2017 Copyright BioMed Central 2017
Copyright_xml	– notice: The Author(s) 2017 – notice: Copyright BioMed Central 2017
DBID	C6C AAYXX CITATION NPM 3V. 7QO 7QP 7QR 7TK 7X7 7XB 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABJCF ABUWG AEUYN AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ K9. L6V LK8 M0S M7P M7S P5Z P62 P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS PTHSS 7X8 5PM DOA
DOI	10.1186/s13015-017-0103-2
DatabaseName	Springer Nature OA Free Journals CrossRef PubMed ProQuest Central (Corporate) Biotechnology Research Abstracts Calcium & Calcified Tissue Abstracts Chemoreception Abstracts Neurosciences Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection ProQuest Hospital Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest One Sustainability ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC Biological Science Collection ProQuest Central Technology Collection Natural Science Collection ProQuest One Community College ProQuest Central Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) ProQuest Engineering Collection Biological Sciences ProQuest Health & Medical Collection Biological Science Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef PubMed Publicly Available Content Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials SciTech Premium Collection ProQuest Central China ProQuest One Applied & Life Sciences ProQuest One Sustainability Health Research Premium Collection Natural Science Collection Biological Science Collection Chemoreception Abstracts ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Biological Science Database Neurosciences Abstracts ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic Calcium & Calcified Tissue Abstracts ProQuest One Academic (New) Technology Collection Technology Research Database ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Central ProQuest Health & Medical Research Collection ProQuest Engineering Collection Biotechnology Research Abstracts Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest Central (Alumni) MEDLINE - Academic
DatabaseTitleList	MEDLINE - Academic Publicly Available Content Database PubMed
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Biology
EISSN	1748-7188
EndPage	11
ExternalDocumentID	oai_doaj_org_article_f7d810119b154eaeb04d06d395d9dd70 PMC5433102 28515774 10_1186_s13015_017_0103_2
Genre	Journal Article
GrantInformation_xml	– fundername: Israel Science Foundation grantid: 317/13 funderid: http://dx.doi.org/10.13039/501100003977 – fundername: National Institutes of Health grantid: RO1HG005690 funderid: http://dx.doi.org/10.13039/100000002 – fundername: I-CORE in Algorithms – fundername: National Science Foundation (US) grantid: CAREER Award CCF-1053753 – fundername: Israeli Center of Research Excellence – fundername: Dotan Hemato-Oncology Research Center – fundername: NHGRI NIH HHS grantid: R01 HG005690 – fundername: ; – fundername: ; grantid: 317/13 – fundername: ; grantid: RO1HG005690 – fundername: ; grantid: CAREER Award CCF-1053753
GroupedDBID	0R~ 23M 2WC 53G 5GY 5VS 6J9 7X7 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AASML ABDBF ABJCF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADRAZ ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK E3Z EBD EBLON EBS EJD ESX F5P FYUFA GROUPED_DOAJ GX1 H13 HCIFZ HMCUK HYE IAO IGS IHR ITC KQ8 L6V LK8 M48 M7P M7S M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS PUEGO RBZ RNS ROL RPM RSV SBL SOJ TR2 TUS UKHRP WOQ WOW ~8M AAYXX AFFHD CITATION 2VQ 4.4 AHSBF ALIPV C1A IPNFZ NPM RIG 3V. 7QO 7QP 7QR 7TK 7XB 8FD 8FK AZQEC DWQXO FR3 GNUQQ K9. P64 PJZUB PKEHL PPXIY PQEST PQUKI PRINS 7X8 5PM
ID	FETCH-LOGICAL-c536t-ee02f8fa262b4e1069a48196b731a09b0ff9eaa0dbdc26a4dc6f1ab48358a0033
IEDL.DBID	RSV
ISICitedReferencesCount	28
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000401874100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1748-7188
IngestDate	Tue Oct 14 15:12:08 EDT 2025 Tue Nov 04 02:00:31 EST 2025 Sun Nov 09 09:32:01 EST 2025 Tue Oct 07 05:35:41 EDT 2025 Mon Jul 21 05:48:31 EDT 2025 Tue Nov 18 21:33:45 EST 2025 Sat Nov 29 05:10:43 EST 2025 Sat Sep 06 07:29:42 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Somatic mutation Phylogeny Maximum parsimony Copy-number variant Cancer
Language	English
License	Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c536t-ee02f8fa262b4e1069a48196b731a09b0ff9eaa0dbdc26a4dc6f1ab48358a0033
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
OpenAccessLink	https://link.springer.com/10.1186/s13015-017-0103-2
PMID	28515774
PQID	1904758200
PQPubID	55040
PageCount	11
ParticipantIDs	doaj_primary_oai_doaj_org_article_f7d810119b154eaeb04d06d395d9dd70 pubmedcentral_primary_oai_pubmedcentral_nih_gov_5433102 proquest_miscellaneous_1900129493 proquest_journals_1904758200 pubmed_primary_28515774 crossref_citationtrail_10_1186_s13015_017_0103_2 crossref_primary_10_1186_s13015_017_0103_2 springer_journals_10_1186_s13015_017_0103_2
PublicationCentury	2000
PublicationDate	2017-05-16
PublicationDateYYYYMMDD	2017-05-16
PublicationDate_xml	– month: 05 year: 2017 text: 2017-05-16 day: 16
PublicationDecade	2010
PublicationPlace	London
PublicationPlace_xml	– name: London – name: England
PublicationTitle	Algorithms for molecular biology
PublicationTitleAbbrev	Algorithms Mol Biol
PublicationTitleAlternate	Algorithms Mol Biol
PublicationYear	2017
Publisher	BioMed Central Springer Nature B.V BMC
Publisher_xml	– name: BioMed Central – name: Springer Nature B.V – name: BMC
References	A Sottoriva (103_CR17) 2015; 47 V Popic (103_CR3) 2015; 16 R Schwarz (103_CR12) 2014; 10 K Yuan (103_CR5) 2015; 16 103_CR7 J Felsenstein (103_CR2) 2004 G Ciriello (103_CR8) 2013; 45 103_CR13 S Chowdhury (103_CR10) 2014; 10 103_CR14 LR Foulds (103_CR15) 1982; 3 PC Nowell (103_CR1) 1976; 194 R Fisher (103_CR9) 2013; 108 103_CR11 M El-Kebir (103_CR4) 2015; 31 W Jiao (103_CR6) 2014; 15 DF Robinson (103_CR16) 1981; 53
References_xml	– volume: 45 start-page: 1127 year: 2013 ident: 103_CR8 publication-title: Nat Genet doi: 10.1038/ng.2762 – volume: 16 start-page: 36 year: 2015 ident: 103_CR5 publication-title: Genome Biol doi: 10.1186/s13059-015-0592-6 – volume: 10 start-page: e1003740 issue: 7 year: 2014 ident: 103_CR10 publication-title: PLoS Comput Biol doi: 10.1371/journal.pcbi.1003740 – ident: 103_CR11 doi: 10.1007/978-3-662-48221-6_8 – volume: 108 start-page: 479 issue: 3 year: 2013 ident: 103_CR9 publication-title: Brit J Cancer doi: 10.1038/bjc.2012.581 – volume: 10 start-page: e1003535 issue: 4 year: 2014 ident: 103_CR12 publication-title: PLoS Comput Biol doi: 10.1371/journal.pcbi.1003535 – volume: 31 start-page: 62 issue: 12 year: 2015 ident: 103_CR4 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btv261 – ident: 103_CR7 doi: 10.1093/bioinformatics/btv003 – volume: 53 start-page: 131 year: 1981 ident: 103_CR16 publication-title: Math Biosci doi: 10.1016/0025-5564(81)90043-2 – ident: 103_CR13 – volume: 3 start-page: 43 year: 1982 ident: 103_CR15 publication-title: Adv Appl Math doi: 10.1016/S0196-8858(82)80004-3 – volume-title: Inferring phylogenies year: 2004 ident: 103_CR2 – volume: 15 start-page: 35 year: 2014 ident: 103_CR6 publication-title: BMC Bioinform doi: 10.1186/1471-2105-15-35 – volume: 16 start-page: 91 year: 2015 ident: 103_CR3 publication-title: Genome Biol doi: 10.1186/s13059-015-0647-8 – volume: 194 start-page: 23 year: 1976 ident: 103_CR1 publication-title: Science doi: 10.1126/science.959840 – ident: 103_CR14 doi: 10.1007/978-3-319-43681-4_11 – volume: 47 start-page: 209 issue: 3 year: 2015 ident: 103_CR17 publication-title: Nat Genet doi: 10.1038/ng.3214
SSID	ssj0045303
Score	2.2237399
Snippet	Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent... Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of... Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent... Abstract Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One...
SourceID	doaj pubmedcentral proquest pubmed crossref springer
SourceType	Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher
StartPage	13
SubjectTerms	Aberration Algorithms Bioinformatics Biomedical and Life Sciences Cancer Cellular and Medical Topics Children Chromosomes Complexity Computational Biology/Bioinformatics Computer simulation Computing time Copy number Copy-number variant Diagnosis Dynamic programming Evolutionary algorithms Genes Graph theory Leaves Life Sciences Maximum parsimony Mutation Phylogenetics Phylogeny Physiological Prognosis Quality assessment Selected papers from WABI 2016 Somatic mutation
SummonAdditionalLinks	– databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1La9wwEB5KaCGX0FcSJ2lxIacWEVmWZQtyaUtDDyX00EBuQs8kkHiXeBPYf9-R5F2yzevSqyUbeTSPb6zxNwD71rngpJUkWGoIrzX6Qd0ZgtHKNrZmtXOJZ_ZXe3zcnZ7K33dafcWasEwPnAV3EFoXOagqaTDYe-0N5Y4KV8vGSXxOytZpKxfJVPbBvEHPPJ5hVp04GNBTV7FILZZZ0pqwlSiUyPofQpj3CyX_OS1NQejoNWyM6LH8mlf9Bl74_i28yv0k5-_gMFp3ZLiczUvdu1Jfnk0w-T-_GkrEpqWdTOcktwAp_e2oc-XYUmZ4DydHP_58_0nG9gjENrWYEe8pC13QTDDDPaZ2UnOM78K0daWpNDQE6bWmzjjLhObOilBpwxFzdTr2cNuEtX7S-20oPXWhcdxjbNdo1F3HLXOVbRFb2UCNLoAuxKXsyB0eW1hcqpRDdEJlCSuUsIoSVqyAz8tbppk446nJ3-IeLCdGzut0ATVBjZqgntOEAvYWO6hGQxwU4h2OKRH6ggI-LYfRhOK5iO795CbNiZ_juKwL2MobvlwJQ0TaIEQuoF1RhZWlro70F-eJpruJP6NRfLcvC6W5s6zHJLHzPySxC-ss6XpDKrEHa7PrG_8BXtrb2cVw_TFZyl-rEBax priority: 102 providerName: Directory of Open Access Journals – databaseName: Biological Science Database dbid: M7P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5BAYkL5U2goCBxAll1HOdhCQm1iIoDqnoAqTfLz7ZSSZZNWmn_PWPHWVgovXCNncj2PPzZM_kG4I2x1lthBPGGasJLhX5QtZrgbmUqU7LS2sgz-6U5PGyPj8VRunAbUlrl7BOjo7a9CXfku7hxccS2KNQPix8kVI0K0dVUQuMm3AosCSym7h3NnphX6J9TJLNo690B_XURUtVCsiUtCdvYiyJl_1U48-90yT9ipnErOtj-30nch3sJhOZ7k9Y8gBuuewh3prKUq0fwPjiJQJQ5rnLV2Vydn-BHxtPvQ44QNzf9YkWmSiK5u0yqm6fKNMNj-Hbw6evHzyRVWSCmKuuROEeZb71iNdPc4QlRKI4wodZNWSgqNPVeOKWo1dawWnFral8ozRG6tSqUgnsCW13fuWeQO2p9ZblDiKDQN7QtN8wWpkGIZjzVKgM6r7c0iYI8VMI4l_Eo0tZyEpFEEckgIskyeLt-ZTHxb1zXeT8Icd0xUGfHB_3yRCZLlL6xgdSsEBrRo1NOU25pbUtRWYGKSTPYmWUnkz0P8pfgMni9bkZLDOEV1bn-IvYJt3pclBk8nTRmPRKGwLZCpJ1Bs6FLG0PdbOnOTiPbdxX-aaM4t3ez1v02rH-txPPrJ_EC7rJoBhUp6h3YGpcX7iXcNpfj2bB8FY3oJ2hMJKE priority: 102 providerName: ProQuest
Title	Complexity and algorithms for copy-number evolution problems
URI	https://link.springer.com/article/10.1186/s13015-017-0103-2 https://www.ncbi.nlm.nih.gov/pubmed/28515774 https://www.proquest.com/docview/1904758200 https://www.proquest.com/docview/1900129493 https://pubmed.ncbi.nlm.nih.gov/PMC5433102 https://doaj.org/article/f7d810119b154eaeb04d06d395d9dd70
Volume	12
WOSCitedRecordID	wos000401874100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVADU databaseName: BioMed Central Open Access Free customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: RBZ dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: DOA dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M~E dateStart: 20060101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M7P dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M7S dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: PIMPY dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVAVX databaseName: Springer Journals customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: RSV dateStart: 20060101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3da9UwFD_opuDL_HbVWSr4pBTTNm0T8MXJhoJeyqZy9aXkc7sw23HbDe5_70naXrw6BX3JQ5NAenLOL78kJ-cAPFdaW80Vj60iMqaZQBwUTMa4WqlcZWmmtY8z-6Gczdh8zqvxHXc3ebtPV5Ieqb1Zs-JVh2ibOEcz5ypJshhxdxtXO-byNRwdf5ngl-YIyuP15ZXdNhYgH6f_KnL5u4_kLxelfv05vP1fI78DOyPdjN4M-nEXrpnmHtwcElCu7sNrBwcuJGa_ikSjI3F20i4X_en3LkIyG6n2fBUPOUMiczkqaTTmoOkewOfDg09v38VjPoVY5VnRx8aQ1DIr0iKV1OBekAuKhKCQZZYIwiWxlhshiJZapYWgWhU2EZIiSWPCJX17CFtN25hdiAzRNtfUIBkQiAKMUZXqRJVIxpQlUgRAJiHXagw27nJenNV-08GKehBKjUKpnVDqNIAX6y7nQ6SNvzXedzO3buiCZPsP7fKkHm2utqV24csSLpEnGmEkoZoUOuO55qiCJIC9ad7r0XK7GgkSxT0UgkcAz9bVaHPuIkU0pr3wbdz5HeVZAI8GNVmPJEUKmyOnDqDcUKCNoW7WNItTH9c7d6_XCP7by0mNfhrWnyTx-J9aP4FbqdfDPE6KPdjqlxfmKdxQl_2iW4ZwvZyXvmQhbO8fzKqj0B9ShM4ltvLlMZZV_g3rq_cfq6-hN74fakwi9A
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Jb9QwFH4qUxBc2JdAgSDBBWTVcZzFEgixVR11OppDkcrJOF7aSiUZJtOi-VP8Rp6zDAxLbz1wjZ3oJf7ee59j-30AT7UxzggtiNO0IDxWGAdVXhDMVjrRMYuNaerMjrLxON_fF5M1-N6fhfHbKvuY2ARqU2n_j3wTExdHbouD-nr6lXjVKL-62ktotLDYsYtvOGWrXw3f4_g-Y2zrw967bdKpChCdxOmcWEuZy51iKSu4xRmRUBzTYlpkcaSoKKhzwipFTWE0SxU3OnWRKjhSlVx56TN87gVY5x7sA1ifDHcnn_rYzxPMCN3aaZSnmzVmiMhvjvPbO2lM2Er2a0QC_sZs_9yg-dsqbZP8tq79b5_tOlztaHb4pvWLG7Bmy5twqRXeXNyClz4M-lKg80WoShOq4wM0en74pQ6RxIe6mi5Iq5US2tPOOcNOe6e-DR_PxfQ7MCir0t6D0FLjEsMtkiCF0S_PuWYm0hmSUO1ooQKg_fhK3RVZ91ofx7KZbOWpbCEhERLSQ0KyAJ4vb5m2FUbO6vzWg2bZ0RcHby5UswPZxRrpMuPLtkWiQH5slS0oNzQ1sUiMQNejAWz0WJFdxKrlT6AE8GTZjLHGLyCp0lYnTR__35KLOIC7LUKXljCk7gnOJQLIVrC7YupqS3l02NQzT_ypPYrv9qJH-S9m_etL3D_7JR7D5e293ZEcDcc7D-AKa1wwIVG6AYP57MQ-hIv6dH5Uzx51LhzC5_OG_w82L4Qh
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bi9UwEB5kveCL99XqqhV8UsqmaXoJ-OLtoLgcFrywbyHX3QNrezjtLpx_7yRNDx5dBfG1SSCdzky-6Uy-AXiujXGGa545TVTGCol-UDYqw9NKl7qghTGBZ_agns-boyN-GPuc9lO1-5SSHO80eJamdthfGjeaeFPt9-h5c1905ssmSZGhD77MfB29D9c_f5tcMSvRQcdU5oXLtg6jwNl_EdD8vV7yl6RpOItmN__7LW7BjQhD09ej3tyGS7a9A1fHxpTru_DKuwlPlTmsU9maVJ4ed6vFcPK9TxHkprpbrrOxl0hqz6PyprE3TX8Pvs7ef3n7IYt9FjJdFtWQWUuoa5ykFVXMYozIJUOgUKm6yCXhijjHrZTEKKNpJZnRlculYgjeGumbwe3CTtu19gGklhhXGmYRJEj0Dk3DNDW5rhGkaUeUTIBMAhc6kpD7XhinIgQjTSVGoQgUivBCETSBF5sly5GB42-T3_ivuJnoybPDg251LKItClcbT2uWc4X40UqrCDOkMgUvDUfVJAnsTTogokX3AoETw9gKnUoCzzbDaIs-wSJb252FOf6_HuNFAvdHldnshCK0LRFrJ1BvKdPWVrdH2sVJ4Psu_a02gu_2clKpn7b1J0k8_KfZT-Ha4buZOPg4__QIrtOgkmWWV3uwM6zO7GO4os-HRb96EuzrBwylJb8
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Complexity+and+algorithms+for+copy-number+evolution+problems&rft.jtitle=Algorithms+for+molecular+biology&rft.au=El-Kebir%2C+Mohammed&rft.au=Raphael%2C+Benjamin+J.&rft.au=Shamir%2C+Ron&rft.au=Sharan%2C+Roded&rft.date=2017-05-16&rft.pub=BioMed+Central&rft.eissn=1748-7188&rft.volume=12&rft.issue=1&rft_id=info:doi/10.1186%2Fs13015-017-0103-2&rft.externalDocID=10_1186_s13015_017_0103_2
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1748-7188&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1748-7188&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1748-7188&client=summon