Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Finding Genetic Network from Experiments by Weighted Network Model.

Noda, Shinohara, Takeda

    Genome Informatics. Workshop on Genome Informatics
    |November 10, 2000
    PubMed
    Summary
    This summary is machine-generated.

    Related Concept Videos

    You might also read

    Related Articles

    Articles linked to this work by shared authors, journal, and citation graph.

    Sort by
    Same author

    Successful closure of a rectovaginal fistula following low anterior resection by endoscopic fibrin glue application.

    Colorectal disease : the official journal of the Association of Coloproctology of Great Britain and Ireland·2013
    Same author

    Pulmonary arterial aneurysm with CATCH 22 syndrome--a case report.

    Angiology·2001
    Same author

    Beta amyloid peptide (Abeta42) is internalized via the G-protein-coupled receptor FPRL1 and forms fibrillar aggregates in macrophages.

    FASEB journal : official publication of the Federation of American Societies for Experimental Biology·2001
    Same author

    Preparation of high activity whole cell biocatalyst by permeabilization of recombinant flocculent yeast with alcohol.

    Enzyme and microbial technology·2000
    Same author

    Authors' reply.

    Histopathology·2000
    Same author

    Plasmon-loss imaging of chains of crystalline-silicon nanospheres and silicon nanowires

    Journal of electron microscopy·2000
    Same journal

    MIAX: a system for assessment of macromolecular interaction. 3) A parallel hybrid GA for flexible protein docking.

    Genome informatics. Workshop on Genome Informatics·2001
    Same journal

    A gene network inference method from continuous-value gene expression data of wild-type and mutants.

    Genome informatics. Workshop on Genome Informatics·2001
    Same journal

    Two-phase partition method for simulating a biological system at an extremely high speed.

    Genome informatics. Workshop on Genome Informatics·2001
    Same journal

    Comparing predictors of disordered protein.

    Genome informatics. Workshop on Genome Informatics·2001
    Same journal

    Intrinsic protein disorder in complete genomes.

    Genome informatics. Workshop on Genome Informatics·2001
    Same journal

    Clustering and averaging of images in single-particle analysis.

    Genome informatics. Workshop on Genome Informatics·2001
    See all related articles

    Researchers can efficiently identify consistent genetic networks from gene perturbation data. However, finding the optimal network is NP-hard, but a 2-approximation algorithm exists.

    Area of Science:

    • Computational biology
    • Bioinformatics
    • Systems biology

    Background:

    • Understanding gene regulatory mechanisms is crucial for deciphering cellular functions.
    • Genetic networks model complex interactions between genes.
    • Experimental data from gene disruptions and overexpressions provide insights into these networks.

    Purpose of the Study:

    • To investigate the computational complexity of inferring genetic networks from perturbation data.
    • To develop efficient algorithms for both finding consistent and optimally consistent genetic networks.

    Main Methods:

    • Defining genetic networks as weighted graphs.
    • Analyzing the computational complexity of network inference.
    • Developing a polynomial-time algorithm for finding consistent networks.

    Related Experiment Videos

  • Proving the NP-hardness of the optimal network inference problem.
  • Designing a polynomial-time approximation algorithm with an approximation ratio of 2.

    • Main Results:

    • A consistent weighted genetic network can be found in polynomial time if one exists.
    • The problem of finding an optimally consistent weighted genetic network is NP-hard.
    • A polynomial-time approximation algorithm achieves an approximation ratio of 2 for the optimization problem.

    Conclusions:

    • Efficient algorithms exist for inferring genetic networks under certain conditions.
    • Optimizing genetic network inference is computationally challenging.
    • The developed approximation algorithm offers a practical approach for finding near-optimal solutions.