Kavosh : a new algorithm for finding network motifs
| Type of Publication: | Journal article |
| Publication status: | Published |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-2--1onffedzzkzv66 |
| Author: | Kashani, Zahra Razaghi Moghadam; Ahrabian, Hayedeh; Elahi, Elahe; Nowzari-Dalini, Abbas; Ansari, Elnaz; Asadi, Sahar; Mohammadi, Shahin; Schreiber, Falk; Masoudi-Nejad, Ali |
| Year of publication: | 2009 |
| Published in: | BMC Bioinformatics ; 10 (2009). - 318. - eISSN 1471-2105 |
| DOI (citable link): | https://dx.doi.org/10.1186/1471-2105-10-318 |
| Summary: |
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.
|
| Subject (DDC): | 004 Computer Science |
| Link to License: | In Copyright |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
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. 10, 318. eISSN 1471-2105. Available under: doi: 10.1186/1471-2105-10-318
@article{Kashani2009Kavos-40487, title={Kavosh : a new algorithm for finding network motifs}, year={2009}, doi={10.1186/1471-2105-10-318}, 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 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/rdf/resource/123456789/40487"> <dc:creator>Ansari, Elnaz</dc:creator> <dc:contributor>Elahi, Elahe</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-06T14:19:45Z</dc:date> <dc:creator>Elahi, Elahe</dc:creator> <dc:creator>Kashani, Zahra Razaghi Moghadam</dc:creator> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/40487/1/Kashani_2--1onffedzzkzv66.pdf"/> <dc:contributor>Masoudi-Nejad, Ali</dc:contributor> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Ansari, Elnaz</dc:contributor> <dc:rights>terms-of-use</dc:rights> <dc:contributor>Mohammadi, Shahin</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"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Asadi, Sahar</dc:contributor> <dc:creator>Ahrabian, Hayedeh</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-06T14:19:45Z</dcterms:available> <dc:contributor>Ahrabian, Hayedeh</dc:contributor> <dc:creator>Nowzari-Dalini, Abbas</dc:creator> <dcterms:issued>2009</dcterms:issued> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Asadi, Sahar</dc:creator> <dcterms:title>Kavosh : a new algorithm for finding network motifs</dcterms:title> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/40487"/> <dc:creator>Schreiber, Falk</dc:creator> <dc:contributor>Kashani, Zahra Razaghi Moghadam</dc:contributor> <dc:language>eng</dc:language> <dc:creator>Masoudi-Nejad, Ali</dc:creator> <dc:contributor>Schreiber, Falk</dc:contributor> <dc:creator>Mohammadi, Shahin</dc:creator> <dc:contributor>Nowzari-Dalini, Abbas</dc:contributor> </rdf:Description> </rdf:RDF>
Downloads since Nov 6, 2017 (Information about access statistics)
| Kashani_2--1onffedzzkzv66.pdf | 230 |
This item appears in the following Collection(s)
Search KOPS
Browse
My Account
