Brain structural and functional connectivity converge prenatally but diverge after birth.
The 4 matches
- [1] § Materials and methods › Non-negative matrix factorization ↔ run_opnmf_stability_analysis.m, lines 1–27 · score 0.85 · negative Matrix Factorization, row represented, Silhouette Coefficient, Adjusted Rand, quantifies, bootstrap
- [2] § Materials and methods › Association with cognitive outcomes at 18 months ↔ run_behavioral_association_analysis.m, lines 20–81 · score 0.81 · behavior associations, max statistic, scan age, cognition, language, motor
- [3] § Results › SF coupling at birth is associated with later developmental outcomes ↔ run_behavioral_association_analysis.m, lines 20–81 · score 0.79 · expressive language, assessment scores, maternal postnatal, max statistic, motor, cognitive
- [4] § Materials and methods › Non-negative matrix factorization ↔ run_opnmf_stability_analysis.m, lines 73–98 · score 0.50 · NMF components, Silhouette Coefficient
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
MATLAB · 250 lines · 8 KB · CC-BY-4.0 · 2 matches
- function results = run_opnmf_stability_analysis(cfg)
- % RUN_OPNMF_STABILITY_ANALYSIS
- % Evaluate model order and parcel-level clustering stability for orthogonal
- % projective non-negative matrix factorization (opNMF).
- %
- % This script was prepared for public code sharing. It uses generic input and
- % output paths and does not include private file paths or project-specific
- % identifiers.
- %
- % Expected input:
- % A numeric matrix with rows representing subjects/scans and columns
- % representing brain regions/parcels. Values should be parcel-wise
- % structure-function coupling (SFC) estimates or another non-negative
- % feature matrix after preprocessing.
- %
- % Main outputs:
- % 1. Mean silhouette coefficient for each candidate factor number k.
- % 2. Bootstrap stability quantified by the adjusted Rand index (ARI).
- % 3. Region-wise cluster assignments for each candidate k.
- %
- % Dependencies:
- % - MATLAB Statistics and Machine Learning Toolbox, for silhouette().
- % - opnmf_mem.m, for orthogonal projective NMF.
- %
- % Author: <replace with author name>
- % License: <replace with selected license, e.g., MIT>
- % Repository/DOI: <replace after Zenodo archiving>
- %% 1. Configure paths and analysis parameters
- if nargin < 1 || isempty(cfg)
- cfg = default_config();
- end
- rng(cfg.random_seed, 'twister');
- if ~exist(cfg.output_dir, 'dir')
- mkdir(cfg.output_dir);
- end
- input_file = fullfile(cfg.input_dir, cfg.input_filename);
- assert(exist(input_file, 'file') == 2, 'Input file not found: %s', input_file);
- %% 2. Load parcel-wise SFC matrix
- % The input matrix should have dimensions: subjects/scans x regions.
- sfc_matrix = readmatrix(input_file, 'TreatAsMissing', cfg.missing_values);
- [n_subjects, n_regions] = size(sfc_matrix);
- assert(n_subjects > 1 && n_regions > 1, ...
- 'Input matrix must contain more than one subject/scan and more than one region.');
- if any(~isfinite(sfc_matrix(:)))
- error(['The input matrix contains NaN or Inf values. ', ...
- 'Please remove or impute missing values before running opNMF.']);
- end
- %% 3. Shift values to satisfy the non-negativity requirement of NMF
- % NMF requires non-negative input. For correlation-like SFC values, adding a
- % constant shift can be used when values are bounded within a known range.
- % Set cfg.nonnegative_shift = 0 if the input matrix is already non-negative.
- analysis_matrix = sfc_matrix + cfg.nonnegative_shift;
- if any(analysis_matrix(:) < 0)
- error(['The analysis matrix still contains negative values after applying ', ...
- 'cfg.nonnegative_shift. Increase the shift or use another ', ...
- 'non-negative transformation before NMF.']);
- end
- %% 4. Transpose matrix for region-wise opNMF clustering
- % opNMF is applied to a regions x subjects/scans matrix so that each row is a
- % brain region and each column is an observation.
- mat = analysis_matrix';
- %% 5. Run opNMF across candidate model orders
- k_values = cfg.k_range(:)';
- n_k = numel(k_values);
- classification = zeros(n_k, n_regions);
- silhouette_mean = zeros(n_k, 1);
- reconstruction_error = zeros(n_k, 1);
- for k_idx = 1:n_k
- k = k_values(k_idx);
- % W contains region x factor weights; H contains factor x observation
- % weights. The maximum loading of each row of W is used to assign each
- % region to one opNMF component.
- [W, H] = opnmf_mem(mat, k, [], cfg.n_opnmf_runs);
- [~, labels] = max(W, [], 2);
- classification(k_idx, :) = labels';
- % Calculate the mean silhouette coefficient across regions.
- s = silhouette(mat, labels);
- silhouette_mean(k_idx) = mean(s(~isnan(s)));
- % Optional diagnostic: relative Frobenius reconstruction error.
- reconstruction_error(k_idx) = norm(mat - W * H, 'fro') / norm(mat, 'fro');
- end
- %% 6. Assess bootstrap stability of region-wise classification
- n_bootstraps = cfg.n_bootstraps;
- bootstrap_sample_size = round(n_subjects * cfg.bootstrap_fraction);
- bootstrap_sample_size = max(2, min(bootstrap_sample_size, n_subjects));
- classification_bootstrap = zeros(n_regions, n_bootstraps, n_k);
- bootstrap_subject_indices = cell(n_bootstraps, n_k);
- for k_idx = 1:n_k
- k = k_values(k_idx);
- for b = 1:n_bootstraps
- subject_idx = randperm(n_subjects, bootstrap_sample_size);
- bootstrap_subject_indices{b, k_idx} = subject_idx;
- [W_boot, ~] = opnmf_mem(mat(:, subject_idx), k, [], cfg.n_opnmf_runs);
- [~, labels_boot] = max(W_boot, [], 2);
- classification_bootstrap(:, b, k_idx) = labels_boot;
- end
- end
- %% 7. Calculate adjusted Rand index between full-sample and bootstrap labels
- ari = zeros(n_bootstraps, n_k);
- for k_idx = 1:n_k
- labels_full = classification(k_idx, :)';
- for b = 1:n_bootstraps
- labels_boot = classification_bootstrap(:, b, k_idx);
- ari(b, k_idx) = adjusted_rand_index(labels_boot, labels_full);
- end
- end
- mean_ari = mean(ari, 1);
- std_ari = std(ari, 0, 1);
- %% 8. Save results
- summary_table = table(k_values', silhouette_mean, reconstruction_error, ...
- mean_ari', std_ari', ...
- 'VariableNames', {'k', 'mean_silhouette', 'relative_reconstruction_error', ...
- 'mean_adjusted_rand_index', 'std_adjusted_rand_index'});
- writetable(summary_table, fullfile(cfg.output_dir, 'opnmf_model_order_summary.csv'));
- results = struct();
- results.config = cfg;
- results.n_subjects = n_subjects;
- results.n_regions = n_regions;
- results.k_values = k_values;
- results.classification = classification;
- results.classification_bootstrap = classification_bootstrap;
- results.bootstrap_subject_indices = bootstrap_subject_indices;
- results.silhouette_mean = silhouette_mean;
- results.reconstruction_error = reconstruction_error;
- results.ari = ari;
- results.mean_ari = mean_ari;
- results.std_ari = std_ari;
- results.summary_table = summary_table;
- save(fullfile(cfg.output_dir, 'opnmf_stability_results.mat'), 'results');
- end
- function cfg = default_config()
- % DEFAULT_CONFIG
- % Default settings for the opNMF model-order and stability analysis.
- project_dir = pwd;
- cfg = struct();
- cfg.input_dir = fullfile(project_dir, 'data');
- cfg.output_dir = fullfile(project_dir, 'results', 'opnmf_stability');
- % Use a generic file name for public release. Replace this with the actual
- % input file name locally, but avoid exposing private project paths or
- % sensitive dataset identifiers in public code if not necessary.
- cfg.input_filename = 'sfc_matrix_subjects_by_regions.txt';
- % Candidate numbers of opNMF components.
- cfg.k_range = 2:10;
- % Number of repeated initializations or internal opNMF runs, depending on the
- % implementation of opnmf_mem.m.
- cfg.n_opnmf_runs = 4;
- % Bootstrap settings.
- cfg.n_bootstraps = 100;
- cfg.bootstrap_fraction = 0.50;
- % Additive shift to ensure non-negative input. For SFC values bounded between
- % -1 and 1, a shift of 1 maps them to [0, 2].
- cfg.nonnegative_shift = 1;
- % Reproducibility.
- cfg.random_seed = 1;
- % Missing value strings recognized by readmatrix(). Numeric NaNs are checked
- % after loading and should be handled before NMF.
- cfg.missing_values = {'NaN', 'NA'};
- end
- function ari = adjusted_rand_index(labels_a, labels_b)
- % ADJUSTED_RAND_INDEX
- % Compute the adjusted Rand index between two partitions.
- %
- % This local implementation avoids requiring an external rand_index()
- % function and makes the script easier to reuse.
- labels_a = labels_a(:);
- labels_b = labels_b(:);
- valid_idx = isfinite(labels_a) & isfinite(labels_b);
- labels_a = labels_a(valid_idx);
- labels_b = labels_b(valid_idx);
- n = numel(labels_a);
- if n < 2
- ari = NaN;
- return;
- end
- [~, ~, labels_a] = unique(labels_a);
- [~, ~, labels_b] = unique(labels_b);
- contingency = accumarray([labels_a, labels_b], 1);
- row_sums = sum(contingency, 2);
- col_sums = sum(contingency, 1);
- sum_comb_cells = sum(comb2(contingency(:)));
- sum_comb_rows = sum(comb2(row_sums));
- sum_comb_cols = sum(comb2(col_sums));
- total_comb = comb2(n);
- expected_index = (sum_comb_rows * sum_comb_cols) / total_comb;
- max_index = 0.5 * (sum_comb_rows + sum_comb_cols);
- denominator = max_index - expected_index;
- if abs(denominator) < eps
- ari = 1;
- else
- ari = (sum_comb_cells - expected_index) / denominator;
- end
- end
- function y = comb2(x)
- % Number of unordered pairs that can be selected from x elements.
- y = x .* (x - 1) ./ 2;
- end
run_opnmf_stability_analysis.m, under CC-BY-4.0 · at the source
Overview
- College of Biomedical Engineering & Instrument Science, Zhejiang University, Hangzhou, China
- Children’s Hospital, Zhejiang University School of Medicine, National Clinical Research Center for Children and Adolescents’ Health and Diseases, Hangzhou, China
- Department of Radiology, The Second Affiliated Hospital and Yuying Children’s Hospital of Wenzhou Medical University, Wenzhou, China
- Key Laboratory of Intelligent Medical Imaging of Wenzhou, The First Affiliated Hospital of Wenzhou Medical University, Wenzhou, China
Abstract
Brain anatomical architecture supports its functional activity and complex cognitive processes. However, how the structure–function (SF) relationship establishes and develops during early life, as well as its underlying mechanisms, remain largely unclear. To address these questions, we leveraged multimodal MRI data from two large-scale public databases, the developing Human Connectome Project (dHCP) and the Baby Connectome Project (BCP), to characterize the spatiotemporal dynamics of SF coupling from the perinatal period to toddlerhood. Our results revealed that SF coupling at birth exhibited a spatial variation along the sensorimotor-association
Reproduced under the paper's license (CC BY), from the paper cited above.
Repositories
Its files are read in the Code ↔ Paper reader above, with 4 matches between paragraphs and lines of code.
Zenodo 21316924
Availability: 1 check, the latest on 26 September 2026: the link answers (HTTP 200)
- 26 September 2026: the link answers (HTTP 200)
4 files
- run_behavioral_associati
on_analysis.m , MATLAB, 414 lines, 2 matches - run_gam_trajectory.R, R, 359 lines
- run_opnmf_stability_anal
ysis.m , MATLAB, 250 lines, 2 matches - run_spatial_spin_correla
tion_test.m , MATLAB, 326 lines
brainlife/BCT
b7f59ebcf0b4f4979ab3914e30c61eaf345b11d5, 16 December 2020Availability: 1 check, the latest on 26 September 2026: the link answers
- 26 September 2026: the link answers
136 files
- BCT/
2019_03_03_BCT/ , MATLAB, 53 linesadjacency_plot_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 60 linesagreement.m - BCT/
2019_03_03_BCT/ , MATLAB, 28 linesagreement_weighted.m - BCT/
2019_03_03_BCT/ , MATLAB, 135 linesalign_matrices.m - BCT/
2019_03_03_BCT/ , MATLAB, 64 linesassortativity_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 62 linesassortativity_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 64 linesbackbone_wu.m - BCT/
2019_03_03_BCT/ , MATLAB, 53 linesbetweenness_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 76 linesbetweenness_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 62 linesbreadth.m - BCT/
2019_03_03_BCT/ , MATLAB, 39 linesbreadthdist.m - BCT/
2019_03_03_BCT/ , MATLAB, 79 linescharpath.m - BCT/
2019_03_03_BCT/ , MATLAB, 102 linesclique_communities.m - BCT/
2019_03_03_BCT/ , MATLAB, 35 linesclustering_coef_bd.m - BCT/
2019_03_03_BCT/ , MATLAB, 28 linesclustering_coef_bu.m - BCT/
2019_03_03_BCT/ , MATLAB, 42 linesclustering_coef_wd.m - BCT/
2019_03_03_BCT/ , MATLAB, 30 linesclustering_coef_wu.m - BCT/
2019_03_03_BCT/ , MATLAB, 136 linesclustering_coef_wu_sign. m - BCT/
2019_03_03_BCT/ , MATLAB, 198 linescommunity_louvain.m - BCT/
2019_03_03_BCT/ , MATLAB, 96 linesconsensus_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 88 linescore_periphery_dir.m - BCT/
2019_03_03_BCT/ , MATLAB, 45 linescycprob.m - BCT/
2019_03_03_BCT/ , MATLAB, 116 linesdata_and_demos/ demo_efficiency_measures .m - BCT/
2019_03_03_BCT/ , MATLAB, 52 linesdata_and_demos/ demo_generative_models_g eometric.m - BCT/
2019_03_03_BCT/ , MATLAB, 52 linesdata_and_demos/ demo_generative_models_n eighbors.m - BCT/
2019_03_03_BCT/ , MATLAB, 31 linesdegrees_dir.m - BCT/
2019_03_03_BCT/ , MATLAB, 22 linesdegrees_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 24 linesdensity_dir.m - BCT/
2019_03_03_BCT/ , MATLAB, 28 linesdensity_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 33 linesdiffusion_efficiency.m - BCT/
2019_03_03_BCT/ , MATLAB, 45 linesdistance_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 71 linesdistance_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 121 linesdistance_wei_floyd.m - BCT/
2019_03_03_BCT/ , MATLAB, 46 linesdiversity_coef_sign.m - BCT/
2019_03_03_BCT/ , MATLAB, 68 linesedge_betweenness_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 82 linesedge_betweenness_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 48 linesedge_nei_overlap_bd.m - BCT/
2019_03_03_BCT/ , MATLAB, 45 linesedge_nei_overlap_bu.m - BCT/
2019_03_03_BCT/ , MATLAB, 76 linesefficiency_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 136 linesefficiency_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 37 lineseigenvector_centrality_u nd.m - BCT/
2019_03_03_BCT/ , MATLAB, 45 lineserange.m - BCT/
2019_03_03_BCT/ , MATLAB, 100 linesevaluate_generative_mode l.m - BCT/
2019_03_03_BCT/ , MATLAB, 50 linesfind_motif34.m - BCT/
2019_03_03_BCT/ , MATLAB, 158 linesfindpaths.m - BCT/
2019_03_03_BCT/ , MATLAB, 41 linesfindwalks.m - BCT/
2019_03_03_BCT/ , MATLAB, 51 linesflow_coef_bd.m - BCT/
2019_03_03_BCT/ , MATLAB, 83 linesgateway_coef_sign.m - BCT/
2019_03_03_BCT/ , MATLAB, 241 linesgenerate_fc.m - BCT/
2019_03_03_BCT/ , MATLAB, 897 linesgenerative_model.m - BCT/
2019_03_03_BCT/ , MATLAB, 57 linesget_components.m - BCT/
2019_03_03_BCT/ , MATLAB, 46 linesgrid_communities.m - BCT/
2019_03_03_BCT/ , MATLAB, 81 linesgtom.m - BCT/
2019_03_03_BCT/ , MATLAB, 48 linesjdegree.m - BCT/
2019_03_03_BCT/ , MATLAB, 59 lineskcore_bd.m - BCT/
2019_03_03_BCT/ , MATLAB, 58 lineskcore_bu.m - BCT/
2019_03_03_BCT/ , MATLAB, 27 lineskcoreness_centrality_bd. m - BCT/
2019_03_03_BCT/ , MATLAB, 34 lineskcoreness_centrality_bu. m - BCT/
2019_03_03_BCT/ , MATLAB, 91 lineslatmio_dir.m - BCT/
2019_03_03_BCT/ , MATLAB, 119 lineslatmio_dir_connected.m - BCT/
2019_03_03_BCT/ , MATLAB, 109 lineslatmio_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 136 lineslatmio_und_connected.m - BCT/
2019_03_03_BCT/ , MATLAB, 150 lineslink_communities.m - BCT/
2019_03_03_BCT/ , MATLAB, 44 lineslocal_assortativity_wu_s ign.m - BCT/
2019_03_03_BCT/ , MATLAB, 90 linesmake_motif34lib.m - BCT/
2019_03_03_BCT/ , MATLAB, 75 linesmakeevenCIJ.m - BCT/
2019_03_03_BCT/ , MATLAB, 49 linesmakefractalCIJ.m - BCT/
2019_03_03_BCT/ , MATLAB, 45 linesmakelatticeCIJ.m - BCT/
2019_03_03_BCT/ , MATLAB, 24 linesmakerandCIJ_dir.m - BCT/
2019_03_03_BCT/ , MATLAB, 25 linesmakerandCIJ_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 81 linesmakerandCIJdegreesfixed. m - BCT/
2019_03_03_BCT/ , MATLAB, 47 linesmakeringlatticeCIJ.m - BCT/
2019_03_03_BCT/ , MATLAB, 29 linesmaketoeplitzCIJ.m - BCT/
2019_03_03_BCT/ , MATLAB, 80 linesmatching_ind.m - BCT/
2019_03_03_BCT/ , MATLAB, 39 linesmatching_ind_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 45 linesmean_first_passage_time. m - BCT/
2019_03_03_BCT/ , MATLAB, 284 linesmleme_constraint_model.m - BCT/
2019_03_03_BCT/ , MATLAB, 124 linesmodularity_dir.m - BCT/
2019_03_03_BCT/ , MATLAB, 122 linesmodularity_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 41 linesmodule_degree_zscore.m - BCT/
2019_03_03_BCT/ , MATLAB, 78 linesmotif3funct_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 101 linesmotif3funct_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 56 linesmotif3struct_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 80 linesmotif3struct_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 88 linesmotif4funct_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 111 linesmotif4funct_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 65 linesmotif4struct_bin.m - BCT/
2019_03_03_BCT/ , MATLAB, 91 linesmotif4struct_wei.m - BCT/
2019_03_03_BCT/ , MATLAB, 112 linesnavigation_wu.m - BCT/
2019_03_03_BCT/ , MATLAB, 188 linesnull_model_dir_sign.m - BCT/
2019_03_03_BCT/ , MATLAB, 181 linesnull_model_und_sign.m - BCT/
2019_03_03_BCT/ , MATLAB, 57 linespagerank_centrality.m - BCT/
2019_03_03_BCT/ , MATLAB, 49 linesparticipation_coef.m - BCT/
2019_03_03_BCT/ , MATLAB, 47 linesparticipation_coef_sign. m - BCT/
2019_03_03_BCT/ , MATLAB, 97 linespartition_distance.m - BCT/
2019_03_03_BCT/ , MATLAB, 84 linespath_transitivity.m - BCT/
2019_03_03_BCT/ , MATLAB, 228 linespredict_fc.m - BCT/
2019_03_03_BCT/ , MATLAB, 110 linesquasi_idempotence.m - BCT/
2019_03_03_BCT/ , MATLAB, 70 linesrandmio_dir.m - BCT/
2019_03_03_BCT/ , MATLAB, 98 linesrandmio_dir_connected.m - BCT/
2019_03_03_BCT/ , MATLAB, 80 linesrandmio_dir_signed.m - BCT/
2019_03_03_BCT/ , MATLAB, 80 linesrandmio_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 107 linesrandmio_und_connected.m - BCT/
2019_03_03_BCT/ , MATLAB, 80 linesrandmio_und_signed.m - BCT/
2019_03_03_BCT/ , MATLAB, 53 linesrandomize_graph_partial_ und.m - BCT/
2019_03_03_BCT/ , MATLAB, 140 linesrandomizer_bin_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 68 linesreachdist.m - BCT/
2019_03_03_BCT/ , MATLAB, 197 linesrentian_scaling_2d.m - BCT/
2019_03_03_BCT/ , MATLAB, 209 linesrentian_scaling_3d.m - BCT/
2019_03_03_BCT/ , MATLAB, 64 linesreorderMAT.m - BCT/
2019_03_03_BCT/ , MATLAB, 105 linesreorder_matrix.m - BCT/
2019_03_03_BCT/ , MATLAB, 107 linesreorder_mod.m - BCT/
2019_03_03_BCT/ , MATLAB, 140 linesresource_efficiency_bin. m - BCT/
2019_03_03_BCT/ , MATLAB, 37 linesretrieve_shortest_path.m - BCT/
2019_03_03_BCT/ , MATLAB, 53 linesrich_club_bd.m - BCT/
2019_03_03_BCT/ , MATLAB, 49 linesrich_club_bu.m - BCT/
2019_03_03_BCT/ , MATLAB, 75 linesrich_club_wd.m - BCT/
2019_03_03_BCT/ , MATLAB, 72 linesrich_club_wu.m - BCT/
2019_03_03_BCT/ , MATLAB, 87 linesrout_efficiency.m - BCT/
2019_03_03_BCT/ , MATLAB, 40 linesscore_wu.m - BCT/
2019_03_03_BCT/ , MATLAB, 117 linessearch_information.m - BCT/
2019_03_03_BCT/ , MATLAB, 27 linesstrengths_dir.m - BCT/
2019_03_03_BCT/ , MATLAB, 18 linesstrengths_und.m - BCT/
2019_03_03_BCT/ , MATLAB, 30 linesstrengths_und_sign.m - BCT/
2019_03_03_BCT/ , MATLAB, 24 linessubgraph_centrality.m - BCT/
2019_03_03_BCT/ , MATLAB, 19 linesthreshold_absolute.m - BCT/
2019_03_03_BCT/ , MATLAB, 45 linesthreshold_proportional.m - BCT/
2019_03_03_BCT/ , MATLAB, 41 linestransitivity_bd.m - BCT/
2019_03_03_BCT/ , MATLAB, 20 linestransitivity_bu.m - BCT/
2019_03_03_BCT/ , MATLAB, 47 linestransitivity_wd.m - BCT/
2019_03_03_BCT/ , MATLAB, 29 linestransitivity_wu.m - BCT/
2019_03_03_BCT/ , MATLAB, 88 linesweight_conversion.m - BCT/
2019_03_03_BCT/ , MATLAB, 41 lineswritetoPAJ.m - BCT/
release_notes.m , MATLAB, 137 lines - LICENSE, License, 21 lines
- README.md, Text, 36 lines
The paper's code and data availability statement is in the Data section.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 2 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 138 scripts, each with its path and the digest of its content;
- 4 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
Datasets cited
- biomedia.github.io/
dhcp-release-notes , at biomedia.github.io; found in “Data Availability”
Data Availability
The raw data used in this study were obtained from publicly available databases. The dHCP dataset can be accessed at https://
Reproduced under the paper's license (CC BY), from the paper cited above.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 9 authors, 11 MeSH terms, 2 funders, 103 references.
Cite
This paper
Zhao, R., Li, M., Zhang, Y., Chen, R., Ning, C., Zhao, Z., Yan, Z., Wang, M., & Wu, D. (2026). Brain structural and functional connectivity converge prenatally but diverge after birth. PLoS biology, 24(9), e3003927. https://
BibTeX
@article{zhao2026brain,
author = {Zhao, Ruoke and Li, Mingyang and Zhang, Yuqi and Chen, Ruike and Ning, Chenglin and Zhao, Zhiyong and Yan, Zhihan and Wang, Meihao and Wu, Dan},
title = {{Brain structural and functional connectivity converge prenatally but diverge after birth}},
journal = {PLoS biology},
year = {2026},
month = sep,
volume = {24},
number = {9},
pages = {e3003927},
publisher = {PLOS},
issn = {1544-9173},
doi = {10.1371/
url = {https://
pmid = {42715242},
pmcid = {PMC13557396}
}
RIS
TY - JOUR
AU - Zhao, Ruoke
AU - Li, Mingyang
AU - Zhang, Yuqi
AU - Chen, Ruike
AU - Ning, Chenglin
AU - Zhao, Zhiyong
AU - Yan, Zhihan
AU - Wang, Meihao
AU - Wu, Dan
TI - Brain structural and functional connectivity converge prenatally but diverge after birth
T2 - PLoS biology
J2 - PLoS Biol
PY - 2026
DA - 2026/
VL - 24
IS - 9
SP - e3003927
SN - 1544-9173
PB - PLOS
DO - 10.1371/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1371/
"type": "article-journal",
"title": "Brain structural and functional connectivity converge prenatally but diverge after birth",
"container-title": "PLoS biology",
"author": [
{
"family": "Zhao",
"given": "Ruoke"
},
{
"family": "Li",
"given": "Mingyang"
},
{
"family": "Zhang",
"given": "Yuqi"
},
{
"family": "Chen",
"given": "Ruike"
},
{
"family": "Ning",
"given": "Chenglin"
},
{
"family": "Zhao",
"given": "Zhiyong"
},
{
"family": "Yan",
"given": "Zhihan"
},
{
"family": "Wang",
"given": "Meihao"
},
{
"family": "Wu",
"given": "Dan"
}
],
"container-title-short":
"volume": "24",
"issue": "9",
"page": "e3003927",
"DOI": "10.1371/
"PMID": "42715242",
"PMCID": "PMC13557396",
"ISSN": "1544-9173",
"publisher": "PLOS",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
9,
9
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.1038/s42003-025-09444-3 [code]
- Decoupling of neurophysiological activity from structure mirrors global microarchitectural and neuromodulatory trends.Journal: Communications biologyIn common: Brain Connectivity Toolbox, Statistics and Machine Learning Toolbox, 15 references
- [2] doi:10.7554/elife.103097 [code]
- Canonical neurodevelopmental trajectories of structural and functional manifolds.Journal: eLifeIn common: mgcv, Brain Connectivity Toolbox, Statistics and Machine Learning Toolbox, developmental, structural MRI / diffusion, 12 references
- [3] doi:10.1038/s43856-026-01707-2 [code]
- Decreased amyloid-related structure-function coupling in preclinical Alzheimer's disease.Journal: Communications medicineIn common: Statistics and Machine Learning Toolbox, 15 references
- [4] doi:10.1038/s41467-026-71270-w [code]
- Spatiotemporal dynamics of the human cortical functional hierarchy across the lifespan.Journal: Nature communicationsIn common: GIfTI library for MATLAB, Statistics and Machine Learning Toolbox, developmental, fMRI, 11 references
- [5] doi:10.1038/s41467-026-71719-y [code]
- Brain functional-structural gradient coupling reflects development, behavior and genetic influences.Journal: Nature communicationsIn common: GIfTI library for MATLAB, Statistics and Machine Learning Toolbox, developmental, 13 references
- [6] doi:10.1038/s41467-026-76011-7 [code]
- Human cortex organizes dynamic co-fluctuations along the sensorimotor-association
axis. Journal: Nature communicationsIn common: mgcv, Brain Connectivity Toolbox, GIfTI library for MATLAB, 1 other tool, 9 references - [7] doi:10.1038/s41398-026-04130-2 [code]
- White matter structure-function coupling in neonatal brain and its association with Autism-related traits in early childhood.Journal: Translational psychiatryIn common: developmental, structural MRI / diffusion, 10 references
- [8] doi:10.1038/s42003-026-10276-y [code]
- The cellular correlates and adolescent reorganisation of cortical myelination networks in the common marmoset.Journal: Communications biologyIn common: mgcv, Brain Connectivity Toolbox, GIfTI library for MATLAB, 2 other tools, structural MRI / diffusion, 4 references
- [9] doi:10.1002/hbm.70533 [code]
- Trait-Relevant Tasks Improve Personality Prediction From Structural-Functional Brain Network Coupling.Journal: Human brain mappingIn common: Brain Connectivity Toolbox, Statistics and Machine Learning Toolbox, structural MRI / diffusion, 9 references
- [10] doi:10.1093/psyrad/kkag013 [code]
- Convergent and divergent spatial topographies of individualized brain functional networks and their developmental origins.Journal: PsychoradiologyIn common: mgcv, Statistics and Machine Learning Toolbox, developmental, fMRI, 8 references
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 2 repositories of the authors' code, each at its verified commit and with its license, 138 scripts, and 4 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:b84a2b1cbb96eb20…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
