BLANT-fast graphlet sampling tool.
Identifieur interne : 000465 ( PubMed/Curation ); précédent : 000464; suivant : 000466BLANT-fast graphlet sampling tool.
Auteurs : Sridevi Maharaj [États-Unis] ; Brennan Tracy [États-Unis] ; Wayne B. Hayes [États-Unis]Source :
- Bioinformatics (Oxford, England) [ 1367-4811 ] ; 2019.
Abstract
BLAST creates local sequence alignments by first building a database of small k-letter sub-sequences called k-mers. Identical k-mers from different regions provide 'seeds' for longer local alignments. This seed-and-extend heuristic makes BLAST extremely fast and has led to its almost exclusive use despite the existence of more accurate, but slower, algorithms. In this paper, we introduce the Basic Local Alignment for Networks Tool (BLANT). BLANT is the analog of BLAST, but for networks: given an input graph, it samples small, induced, k-node sub-graphs called k-graphlets. Graphlets have been used to classify networks, quantify structure, align networks both locally and globally, identify topology-function relationships and build taxonomic trees without the use of sequences. Given an input network, BLANT produces millions of graphlet samples in seconds-orders of magnitude faster than existing methods. BLANT offers sampled graphlets in various forms: distributions of graphlets or their orbits; graphlet degree or graphlet orbit degree vectors, the latter being compatible with ORCA; or an index to be used as the basis for seed-and-extend local alignments. We demonstrate BLANT's usefelness by using its indexing mode to find functional similarity between yeast and human PPI networks.
DOI: 10.1093/bioinformatics/btz603
PubMed: 31373347
Links toward previous steps (curation, corpus...)
- to stream PubMed, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000465
Links to Exploration step
pubmed:31373347Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">BLANT-fast graphlet sampling tool.</title>
<author><name sortKey="Maharaj, Sridevi" sort="Maharaj, Sridevi" uniqKey="Maharaj S" first="Sridevi" last="Maharaj">Sridevi Maharaj</name>
<affiliation wicri:level="1"><nlm:affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, University of California Irvine, Irvine, CA</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Tracy, Brennan" sort="Tracy, Brennan" uniqKey="Tracy B" first="Brennan" last="Tracy">Brennan Tracy</name>
<affiliation wicri:level="1"><nlm:affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, University of California Irvine, Irvine, CA</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Hayes, Wayne B" sort="Hayes, Wayne B" uniqKey="Hayes W" first="Wayne B" last="Hayes">Wayne B. Hayes</name>
<affiliation wicri:level="1"><nlm:affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, University of California Irvine, Irvine, CA</wicri:regionArea>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">PubMed</idno>
<date when="2019">2019</date>
<idno type="RBID">pubmed:31373347</idno>
<idno type="pmid">31373347</idno>
<idno type="doi">10.1093/bioinformatics/btz603</idno>
<idno type="wicri:Area/PubMed/Corpus">000465</idno>
<idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Corpus" wicri:corpus="PubMed">000465</idno>
<idno type="wicri:Area/PubMed/Curation">000465</idno>
<idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Curation">000465</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">BLANT-fast graphlet sampling tool.</title>
<author><name sortKey="Maharaj, Sridevi" sort="Maharaj, Sridevi" uniqKey="Maharaj S" first="Sridevi" last="Maharaj">Sridevi Maharaj</name>
<affiliation wicri:level="1"><nlm:affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, University of California Irvine, Irvine, CA</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Tracy, Brennan" sort="Tracy, Brennan" uniqKey="Tracy B" first="Brennan" last="Tracy">Brennan Tracy</name>
<affiliation wicri:level="1"><nlm:affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, University of California Irvine, Irvine, CA</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Hayes, Wayne B" sort="Hayes, Wayne B" uniqKey="Hayes W" first="Wayne B" last="Hayes">Wayne B. Hayes</name>
<affiliation wicri:level="1"><nlm:affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, University of California Irvine, Irvine, CA</wicri:regionArea>
</affiliation>
</author>
</analytic>
<series><title level="j">Bioinformatics (Oxford, England)</title>
<idno type="eISSN">1367-4811</idno>
<imprint><date when="2019" type="published">2019</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">BLAST creates local sequence alignments by first building a database of small k-letter sub-sequences called k-mers. Identical k-mers from different regions provide 'seeds' for longer local alignments. This seed-and-extend heuristic makes BLAST extremely fast and has led to its almost exclusive use despite the existence of more accurate, but slower, algorithms. In this paper, we introduce the Basic Local Alignment for Networks Tool (BLANT). BLANT is the analog of BLAST, but for networks: given an input graph, it samples small, induced, k-node sub-graphs called k-graphlets. Graphlets have been used to classify networks, quantify structure, align networks both locally and globally, identify topology-function relationships and build taxonomic trees without the use of sequences. Given an input network, BLANT produces millions of graphlet samples in seconds-orders of magnitude faster than existing methods. BLANT offers sampled graphlets in various forms: distributions of graphlets or their orbits; graphlet degree or graphlet orbit degree vectors, the latter being compatible with ORCA; or an index to be used as the basis for seed-and-extend local alignments. We demonstrate BLANT's usefelness by using its indexing mode to find functional similarity between yeast and human PPI networks.</div>
</front>
</TEI>
<pubmed><MedlineCitation Status="In-Data-Review" Owner="NLM"><PMID Version="1">31373347</PMID>
<DateRevised><Year>2020</Year>
<Month>01</Month>
<Day>11</Day>
</DateRevised>
<Article PubModel="Print"><Journal><ISSN IssnType="Electronic">1367-4811</ISSN>
<JournalIssue CitedMedium="Internet"><Volume>35</Volume>
<Issue>24</Issue>
<PubDate><Year>2019</Year>
<Month>Dec</Month>
<Day>15</Day>
</PubDate>
</JournalIssue>
<Title>Bioinformatics (Oxford, England)</Title>
<ISOAbbreviation>Bioinformatics</ISOAbbreviation>
</Journal>
<ArticleTitle>BLANT-fast graphlet sampling tool.</ArticleTitle>
<Pagination><MedlinePgn>5363-5364</MedlinePgn>
</Pagination>
<ELocationID EIdType="doi" ValidYN="Y">10.1093/bioinformatics/btz603</ELocationID>
<Abstract><AbstractText Label="SUMMARY" NlmCategory="CONCLUSIONS">BLAST creates local sequence alignments by first building a database of small k-letter sub-sequences called k-mers. Identical k-mers from different regions provide 'seeds' for longer local alignments. This seed-and-extend heuristic makes BLAST extremely fast and has led to its almost exclusive use despite the existence of more accurate, but slower, algorithms. In this paper, we introduce the Basic Local Alignment for Networks Tool (BLANT). BLANT is the analog of BLAST, but for networks: given an input graph, it samples small, induced, k-node sub-graphs called k-graphlets. Graphlets have been used to classify networks, quantify structure, align networks both locally and globally, identify topology-function relationships and build taxonomic trees without the use of sequences. Given an input network, BLANT produces millions of graphlet samples in seconds-orders of magnitude faster than existing methods. BLANT offers sampled graphlets in various forms: distributions of graphlets or their orbits; graphlet degree or graphlet orbit degree vectors, the latter being compatible with ORCA; or an index to be used as the basis for seed-and-extend local alignments. We demonstrate BLANT's usefelness by using its indexing mode to find functional similarity between yeast and human PPI networks.</AbstractText>
<AbstractText Label="AVAILABILITY AND IMPLEMENTATION" NlmCategory="METHODS">BLANT is written in C and is available at https://github.com/waynebhayes/BLANT/releases.</AbstractText>
<AbstractText Label="SUPPLEMENTARY INFORMATION" NlmCategory="BACKGROUND">Supplementary data are available at Bioinformatics online.</AbstractText>
<CopyrightInformation>© The Author(s) 2019. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.</CopyrightInformation>
</Abstract>
<AuthorList CompleteYN="Y"><Author ValidYN="Y"><LastName>Maharaj</LastName>
<ForeName>Sridevi</ForeName>
<Initials>S</Initials>
<AffiliationInfo><Affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</Affiliation>
</AffiliationInfo>
</Author>
<Author ValidYN="Y"><LastName>Tracy</LastName>
<ForeName>Brennan</ForeName>
<Initials>B</Initials>
<AffiliationInfo><Affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</Affiliation>
</AffiliationInfo>
</Author>
<Author ValidYN="Y"><LastName>Hayes</LastName>
<ForeName>Wayne B</ForeName>
<Initials>WB</Initials>
<AffiliationInfo><Affiliation>Department of Computer Science, University of California Irvine, Irvine, CA, USA.</Affiliation>
</AffiliationInfo>
</Author>
</AuthorList>
<Language>eng</Language>
<PublicationTypeList><PublicationType UI="D016428">Journal Article</PublicationType>
</PublicationTypeList>
</Article>
<MedlineJournalInfo><Country>England</Country>
<MedlineTA>Bioinformatics</MedlineTA>
<NlmUniqueID>9808944</NlmUniqueID>
<ISSNLinking>1367-4803</ISSNLinking>
</MedlineJournalInfo>
<CitationSubset>IM</CitationSubset>
</MedlineCitation>
<PubmedData><History><PubMedPubDate PubStatus="received"><Year>2019</Year>
<Month>04</Month>
<Day>24</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="revised"><Year>2019</Year>
<Month>07</Month>
<Day>19</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="accepted"><Year>2019</Year>
<Month>07</Month>
<Day>30</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="pubmed"><Year>2019</Year>
<Month>8</Month>
<Day>3</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
<PubMedPubDate PubStatus="medline"><Year>2019</Year>
<Month>8</Month>
<Day>3</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
<PubMedPubDate PubStatus="entrez"><Year>2019</Year>
<Month>8</Month>
<Day>3</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
</History>
<PublicationStatus>ppublish</PublicationStatus>
<ArticleIdList><ArticleId IdType="pubmed">31373347</ArticleId>
<ArticleId IdType="pii">5542947</ArticleId>
<ArticleId IdType="doi">10.1093/bioinformatics/btz603</ArticleId>
</ArticleIdList>
</PubmedData>
</pubmed>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Sante/explor/MersV1/Data/PubMed/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000465 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PubMed/Curation/biblio.hfd -nk 000465 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Sante |area= MersV1 |flux= PubMed |étape= Curation |type= RBID |clé= pubmed:31373347 |texte= BLANT-fast graphlet sampling tool. }}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/PubMed/Curation/RBID.i -Sk "pubmed:31373347" \ | HfdSelect -Kh $EXPLOR_AREA/Data/PubMed/Curation/biblio.hfd \ | NlmPubMed2Wicri -a MersV1
![]() | This area was generated with Dilib version V0.6.33. | ![]() |