(Q31094033)

English

A faster circular binary segmentation algorithm for the analysis of array CGH data

scientific article

In more languages

edit

Statements

instance of

scholarly article

1 reference

stated in

Europe PubMed Central

28 June 2017

A faster circular binary segmentation algorithm for the analysis of array CGH data (English)

1 reference

stated in

Europe PubMed Central

28 June 2017

E S Venkatraman

1

1 reference

stated in

Europe PubMed Central

PubMed ID

17234643

retrieved

28 June 2017

Adam B Olshen

series ordinal

2

1 reference

stated in

Europe PubMed Central

PubMed ID

17234643

retrieved

28 June 2017

language of work or name

English

0 references

publication date

18 January 2007

1 reference

stated in

Europe PubMed Central

28 June 2017

1 reference

Europe PubMed Central

28 June 2017

23

1 reference

stated in

Europe PubMed Central

28 June 2017

657-663

1 reference

stated in

Europe PubMed Central

28 June 2017

6

1 reference

stated in

Europe PubMed Central

28 June 2017

Bioconductor: open software development for computational biology and bioinformatics

1 reference

20 May 2022

https://opencitations.net/index/coci/api/v1/citations/10.1186/GB-2004-5-10-R80

Identifiers

DOI

10.1093/BIOINFORMATICS/BTL646

1 reference

stated in

Europe PubMed Central

28 June 2017

journals/bioinformatics/VenkatramanO07

1 reference

stated in

DBLP Dataset 2021-01-02

28 January 2021

1 reference

Europe PubMed Central

PubMed ID

17234643

retrieved

28 June 2017

ResearchGate publication ID

6567461

0 references

(Q31094033)

A faster circular binary segmentation algorithm for the analysis of array CGH data

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)