Das Suchergebnis hat sich seit Ihrer Suchanfrage verändert. Eventuell werden Dokumente in anderer Reihenfolge angezeigt.
  • Treffer 19 von 2047
Zurück zur Trefferliste

Automatic network reconstruction using ASP

  • Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarativeBuilding biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarative and thus transparent for biological experts. Second, it is elaboration tolerant and thus allows for an easy exploration and incorporation of biological constraints. Third, it allows for exploring the entire space of possible models. Finally, our approach offers an excellent performance, matching existing, special-purpose systems.zeige mehrzeige weniger

Volltext Dateien herunterladen

  • SHA-1: 75eea60bf9e6390bad6fa7c2b607e8aaa5241250

Metadaten exportieren

Weitere Dienste

Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Markus Durzinsky, Wolfgang Marwan, Max OstrowskiGND, Torsten H. SchaubORCiDGND, Annegret Wagler
URN:urn:nbn:de:kobv:517-opus4-412419
DOI:https://doi.org/10.25932/publishup-41241
ISSN:1866-8372
Titel des übergeordneten Werks (Englisch):Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
Schriftenreihe (Bandnummer):Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe (560)
Publikationstyp:Postprint
Sprache:Englisch
Datum der Erstveröffentlichung:30.01.2019
Erscheinungsjahr:2011
Veröffentlichende Institution:Universität Potsdam
Datum der Freischaltung:30.01.2019
Freies Schlagwort / Tag:answer; biological networks; regulatory networks
Ausgabe:560
Seitenanzahl:18
Quelle:Theory and Practice of Logic Programming 11 (2011) 4–5, pp. 749–766 DOI 10.1017/S1471068411000287
Organisationseinheiten:Mathematisch-Naturwissenschaftliche Fakultät
DDC-Klassifikation:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Peer Review:Referiert
Publikationsweg:Open Access
Fördermittelquelle:Cambridge University Press (CUP)
Lizenz (Deutsch):License LogoKeine öffentliche Lizenz: Unter Urheberrechtsschutz
Externe Anmerkung:Bibliographieeintrag der Originalveröffentlichung/Quelle
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.