CORE
đŸ‡ºđŸ‡¦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
MOESM1 of Complexity and algorithms for copy-number evolution problems
Authors
Benjamin Raphael (4030346)
Meirav Zehavi (4030337)
+5Â more
Mohammed El-Kebir (4030343)
Roded Sharan (23003)
Ron Shamir (11621)
Ron Zeira (4030340)
Simone Zaccaria (4030334)
Publication date
1 January 2017
Publisher
Doi
Cite
Abstract
Additional file 1. The appendix contains the proofs omitted from the main text, the ILP formulation for the Copy-Number Triplet Problem, the complete ILP formulation for the Copy-Number Tree Problem, and additional details about the results
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1186%2Fs13015-017-...
Last time updated on 04/12/2019
FigShare
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:figshare.com:article/50126...
Last time updated on 12/02/2018
Directory of Open Access Journals
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:doaj.org/article:f7d810119...
Last time updated on 04/06/2019
Sustaining member
Princeton University Open Access Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:oar.princeton.edu:88435/pr...
Last time updated on 14/02/2024