kth.sePublikationer KTH
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Image recovery from unknown network mechanisms for DNA sequencing-based microscopy
KTH, Skolan för kemi, bioteknologi och hälsa (CBH), Genteknologi. KTH, Centra, Science for Life Laboratory, SciLifeLab.ORCID-id: 0000-0001-5402-6917
KTH, Skolan för kemi, bioteknologi och hälsa (CBH), Genteknologi. KTH, Centra, Science for Life Laboratory, SciLifeLab.ORCID-id: 0000-0001-6941-4576
2023 (Engelska)Ingår i: Nanoscale, ISSN 2040-3364, E-ISSN 2040-3372, Vol. 15, nr 18, s. 8153-8157Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Imaging-by-sequencing methods are an emerging alternative to conventional optical micro- or nanoscale imaging. In these methods, molecular networks form through proximity-dependent association between DNA molecules carrying random sequence identifiers. DNA strands record pairwise associations such that network structure may be recovered by sequencing which, in turn, reveals the underlying spatial relationships between molecules comprising the network. Determining the computational reconstruction strategy that makes the best use of the information (in terms of spatial localization accuracy, robustness to noise, and scalability) in these networks is an open problem. We present a graph-based technique for reconstructing a diversity of molecular network classes in 2 and 3 dimensions without prior knowledge of their fundamental generation mechanisms. The model achieves robustness by obtaining an unsupervised sampling of local and global network structure using random walks, making use of minimal prior assumptions. Images are recovered from networks in two stages of dimensionality reduction first with a structural discovery step followed by a manifold learning step. By breaking the process into stages, computational complexity could be reduced leading to fast and accurate performance. Our method represents a means by which diverse molecular network generation scenarios can be unified with a common reconstruction framework.

Ort, förlag, år, upplaga, sidor
Royal Society of Chemistry (RSC) , 2023. Vol. 15, nr 18, s. 8153-8157
Nationell ämneskategori
Bioinformatik (beräkningsbiologi) Bioinformatik och beräkningsbiologi
Identifikatorer
URN: urn:nbn:se:kth:diva-338468DOI: 10.1039/d2nr05435cISI: 000970998300001PubMedID: 37078374Scopus ID: 2-s2.0-85153515773OAI: oai:DiVA.org:kth-338468DiVA, id: diva2:1812257
Anmärkning

QC 20231115

Tillgänglig från: 2023-11-15 Skapad: 2023-11-15 Senast uppdaterad: 2025-02-05Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextPubMedScopus

Person

Fernandez Bonet, DavidHoffecker, Ian T.

Sök vidare i DiVA

Av författaren/redaktören
Fernandez Bonet, DavidHoffecker, Ian T.
Av organisationen
GenteknologiScience for Life Laboratory, SciLifeLab
I samma tidskrift
Nanoscale
Bioinformatik (beräkningsbiologi)Bioinformatik och beräkningsbiologi

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
pubmed
urn-nbn

Altmetricpoäng

doi
pubmed
urn-nbn
Totalt: 114 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf