Publikation: Kavosh : a new algorithm for finding network motifs
Lade...
Dateien
Datum
2009
Autor:innen
Kashani, Zahra Razaghi Moghadam
Ahrabian, Hayedeh
Elahi, Elahe
Nowzari-Dalini, Abbas
Ansari, Elnaz
Asadi, Sahar
Mohammadi, Shahin
Masoudi-Nejad, Ali
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Gold
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
BMC Bioinformatics. 2009, 10, 318. eISSN 1471-2105. Available under: doi: 10.1186/1471-2105-10-318
Zusammenfassung
Complex networks are studied across many fields of science and are particularly important to understand biological processes. Motifs in networks are small connected sub-graphs that occur significantly in higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Existing algorithms for finding network motifs are extremely costly in CPU time and memory consumption and have practically restrictions on the size of motifs.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
KASHANI, Zahra Razaghi Moghadam, Hayedeh AHRABIAN, Elahe ELAHI, Abbas NOWZARI-DALINI, Elnaz ANSARI, Sahar ASADI, Shahin MOHAMMADI, Falk SCHREIBER, Ali MASOUDI-NEJAD, 2009. Kavosh : a new algorithm for finding network motifs. In: BMC Bioinformatics. 2009, 10, 318. eISSN 1471-2105. Available under: doi: 10.1186/1471-2105-10-318BibTex
@article{Kashani2009Kavos-40487,
year={2009},
doi={10.1186/1471-2105-10-318},
title={Kavosh : a new algorithm for finding network motifs},
volume={10},
journal={BMC Bioinformatics},
author={Kashani, Zahra Razaghi Moghadam and Ahrabian, Hayedeh and Elahi, Elahe and Nowzari-Dalini, Abbas and Ansari, Elnaz and Asadi, Sahar and Mohammadi, Shahin and Schreiber, Falk and Masoudi-Nejad, Ali},
note={Article Number: 318}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40487">
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:contributor>Masoudi-Nejad, Ali</dc:contributor>
<dc:contributor>Ahrabian, Hayedeh</dc:contributor>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:creator>Ansari, Elnaz</dc:creator>
<dcterms:issued>2009</dcterms:issued>
<dc:language>eng</dc:language>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-06T14:19:45Z</dcterms:available>
<dc:creator>Asadi, Sahar</dc:creator>
<dc:creator>Kashani, Zahra Razaghi Moghadam</dc:creator>
<dc:creator>Nowzari-Dalini, Abbas</dc:creator>
<dc:contributor>Asadi, Sahar</dc:contributor>
<dc:rights>terms-of-use</dc:rights>
<dc:creator>Elahi, Elahe</dc:creator>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-06T14:19:45Z</dc:date>
<dc:contributor>Elahi, Elahe</dc:contributor>
<dc:contributor>Mohammadi, Shahin</dc:contributor>
<dc:creator>Mohammadi, Shahin</dc:creator>
<dc:creator>Schreiber, Falk</dc:creator>
<dc:creator>Ahrabian, Hayedeh</dc:creator>
<dc:contributor>Kashani, Zahra Razaghi Moghadam</dc:contributor>
<dc:creator>Masoudi-Nejad, Ali</dc:creator>
<dc:contributor>Schreiber, Falk</dc:contributor>
<dc:contributor>Nowzari-Dalini, Abbas</dc:contributor>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/40487/1/Kashani_2--1onffedzzkzv66.pdf"/>
<dcterms:title>Kavosh : a new algorithm for finding network motifs</dcterms:title>
<dc:contributor>Ansari, Elnaz</dc:contributor>
<dcterms:abstract xml:lang="eng">Complex networks are studied across many fields of science and are particularly important to understand biological processes. Motifs in networks are small connected sub-graphs that occur significantly in higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Existing algorithms for finding network motifs are extremely costly in CPU time and memory consumption and have practically restrictions on the size of motifs.</dcterms:abstract>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/40487/1/Kashani_2--1onffedzzkzv66.pdf"/>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/40487"/>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
