<?xml version="1.0"?>
<?xml-stylesheet type="text/xsl" href="https://ontobee.org/ontology/view/MCRO?iri=http://www.ebi.ac.uk/swo/SWO_1100117"?>
<rdf:RDF xmlns="http://www.w3.org/2002/07/owl#"
     xml:base="http://www.w3.org/2002/07/owl"
     xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
     xmlns:owl="http://www.w3.org/2002/07/owl#"
     xmlns:oboInOwl="http://www.geneontology.org/formats/oboInOwl#"
     xmlns:xsd="http://www.w3.org/2001/XMLSchema#"
     xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
     xmlns:swo="http://www.ebi.ac.uk/swo/"
     xmlns:ns2="http://purl.obolibrary.org/obo/"
     xmlns:foaf="http://xmlns.com/foaf/0.1/"
     xmlns:dc="http://purl.org/dc/elements/1.1/">
    


    <!-- 
    ///////////////////////////////////////////////////////////////////////////////////////
    //
    // Annotation properties
    //
    ///////////////////////////////////////////////////////////////////////////////////////
     -->

    <AnnotationProperty rdf:about="http://purl.obolibrary.org/obo/IAO_0000115"/>
    


    <!-- 
    ///////////////////////////////////////////////////////////////////////////////////////
    //
    // Datatypes
    //
    ///////////////////////////////////////////////////////////////////////////////////////
     -->

    


    <!-- 
    ///////////////////////////////////////////////////////////////////////////////////////
    //
    // Classes
    //
    ///////////////////////////////////////////////////////////////////////////////////////
     -->

    


    <!-- http://purl.obolibrary.org/obo/IAO_0000064 -->

    <Class rdf:about="http://purl.obolibrary.org/obo/IAO_0000064">
        <rdfs:label>algorithm</rdfs:label>
        <rdfs:label xml:lang="en">algorithm</rdfs:label>
    </Class>
    


    <!-- http://www.ebi.ac.uk/swo/SWO_1100117 -->

    <Class rdf:about="http://www.ebi.ac.uk/swo/SWO_1100117">
        <rdfs:label>CBS</rdfs:label>
        <rdfs:subClassOf rdf:resource="http://purl.obolibrary.org/obo/IAO_0000064"/>
        <ns2:IAO_0000115>The circular binary segmentation (CBS) algorithm divides the genome into regions of equal copy number . The algorithm tests for change-points using a maximal t-statistic with a permutation reference distribution to obtain the corresponding p-value. The number of computations required for the maximal test statistic is O(N^2),where N is the number of markers. This makes the full permutation approach computationally prohibitive for the newer arrays that contain tens of thousands markers and highlights the need for a faster algorithm.</ns2:IAO_0000115>
    </Class>
</rdf:RDF>



<!-- Generated by the OWL API (version 3.2.4.1806) http://owlapi.sourceforge.net -->



