Update application description and enhance documentation for BasicSpanner, emphasizing its capabilities in network analysis across various domains

Author: josemarinfarina

.zenodo.json

@@ -1,7 +1,7 @@
 {
   "title": "BasicSpanner",
   "upload_type": "software",
-  "description": "Extreme graph simplification applied to functional discovery in biological networks.",
+  "description": "Desktop application for extreme graph simplification through basic networks.",
   "creators": [
     {
       "name": "Marín, José",

src/core/AboutPage.h

@@ -21,9 +21,9 @@
  * additional nodes (connectors) required to preserve all pairwise distances
  * that the seeds had in the original network.
  *
- * The tool was developed to support network-based functional discovery,
- * especially in biological interactomes, and to complement conventional
- * techniques such as community detection or Gene Ontology enrichment.
+ * The tool is designed to support network-based structural and functional
+ * analyses in arbitrary undirected graphs, and to complement conventional
+ * techniques such as community detection or shortest-path analysis.
  * BasicSpanner is implemented in C++ using the Qt framework and is available
  * for Linux and Windows.
  *
@@ -107,17 +107,16 @@
  *   distribution obtained from random seed sets of equal size provides a
  *   statistical measure of how closely related the chosen seeds are in the
  *   network.
- * - Complement Gene Ontology and community analyses: basic networks can
- *   highlight functional associations that conventional enrichment
- *   techniques fail to detect and can point out inconsistencies or
- *   omissions in existing annotation databases.
+ * - Complement community and enrichment analyses: basic networks can
+ *   highlight structural associations that conventional techniques fail to
+ *   detect and can point out inconsistencies or omissions in existing
+ *   annotations of the underlying network.
  * - Detect graph inconsistencies: when a single seed dramatically increases
  *   the number of required connectors, it often indicates that the seed is
  *   poorly related to the rest or that the underlying graph contains
  *   missing or erroneous data.
  *
- * Although the reference application domain is the analysis of biological
- * interactomes, the method is applicable to any undirected network.
+ * The method is applicable to any undirected network regardless of domain.
  *
  * @section about_usage Usage
  *
@@ -140,8 +139,8 @@
  *
  * If you use BasicSpanner in your work, please cite:
  *
- * Marin J, Marin I. Extreme graph simplification applied to functional
- * discovery in biological networks (2026).
+ * Marin J, Marin I. BasicSpanner. Zenodo (2026).
+ * https://doi.org/10.5281/zenodo.19697430
  *
  * @section about_license License
  *

src/core/MainPage.h

@@ -62,8 +62,8 @@
  *
  * If you use BasicSpanner in your work, please cite:
  *
- * Marin J, Marin I. Extreme graph simplification applied to functional
- * discovery in biological networks (2026).
+ * Marin J, Marin I. BasicSpanner. Zenodo (2026).
+ * https://doi.org/10.5281/zenodo.19697430
  */
 
 #endif

src/gui/LargeNetworksManager.cpp

@@ -111,7 +111,7 @@ void LargeNetworksManager::setupUI()
 <p>Combines high clustering with short paths. Models social and neural networks.</p>
 
 <h4>Hierarchical Network</h4>
-<p>Modular structure with hierarchical levels. Useful for organizations and biological systems.</p>
+<p>Modular structure with hierarchical levels. Useful for modelling multi-level organizations.</p>
 
 <h3>Tips:</h3>
 <ul>

src/gui/MainWindow.cpp

@@ -415,14 +415,8 @@ Reduce permutation count, or use fewer seeds. Large networks (>10,000 nodes) may
 <div class="section">
 <h2>Use Cases</h2>
 
-<h3>Biological Networks</h3>
-<p>Find the minimal protein/gene pathway connecting disease-related genes. Identify essential mediators in signaling networks.</p>
-
-<h3>Social Networks</h3>
-<p>Discover key individuals connecting different communities. Identify information flow bottlenecks.</p>
-
-<h3>Infrastructure Networks</h3>
-<p>Find critical nodes in transportation or communication networks. Assess network vulnerability.</p>
+<h3>General Network Analysis</h3>
+<p>Given any undirected graph and a set of seed nodes of interest, BasicSpanner extracts the minimal induced subgraph that preserves every pairwise distance among the seeds. This reveals the essential connectors that mediate the relationships between seeds, independently of the application domain.</p>
 </div>
 
 <p style="margin-top: 40px; text-align: center; color: #64748b; font-size: 14px;">
@@ -878,9 +872,9 @@ void MainWindow::about()
            "network: the minimal set of additional nodes (connectors)\n"
            "required to preserve every pairwise distance among the seeds\n"
            "of the original graph.\n\n"
-           "Reference:\n"
-           "Marin J, Marin I. Extreme graph simplification applied to\n"
-           "functional discovery in biological networks (2026)."));
+           "Citation:\n"
+           "Marin J, Marin I. BasicSpanner. Zenodo (2026).\n"
+           "https://doi.org/10.5281/zenodo.19697430"));
 }
 
 void MainWindow::showUserGuide()