{
  "abstract": "Protein domains are commonly regarded as structurally separated, functionally relevant, and evolutionarily separable units. Although classification systems may assign different domain boundaries to the same structure, structural separation remains a shared criterion, and many domain parsers assess it through inter-residue distances, contact numbers, or contact densities. However, the Voronoi contact area, which is widely used to study protein-protein interactions and predict contact sites, has seen limited use in domain parsing. There are two potential challenges to this problem. First, unlike in protein-protein interaction, partitions are not known in advance and must be identified before their interface can be evaluated. Second, the contact area depends on fragment size and internal packing, making it difficult to compare candidate partitions. Here, we introduce VoroTIDE (Voronoi-based Two-way Independent Domain Exploration), a domain parser based on all-heavy-atom Voronoi contact areas. By normalizing the contact area for fragment size and internal packing, and incorporating residue hydropathy, we define a pairwise self-containment score F. VoroTIDE applies F in two independent hierarchical searches: top-down recursive splitting until no admissible division remains, and bottom-up merging of secondary-structure elements until the entire structure becomes a single fragment. Intermediate partitions from both searches are ranked by a global partition quality score G, derived on the same principle. On two CATH-ECOD consensus benchmarks, under balanced evaluation, VoroTIDE achieved the strongest performance among all tested criterion-based parsers and was comparable to Chainsaw, the best-performing deep learning method tested. These results show that the Voronoi-based criterion can yield competitive domain parsing.",
  "abstract_shown": true,
  "affiliations": [
    "CRBM, CNRS"
  ],
  "article_type": "New results",
  "arxiv": null,
  "author_total": 1,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "K. Q. Le"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/dccczvh040pry.bib",
  "cited_by": 0,
  "doi": "10.64898/2026.10.18.759833",
  "fulltext_url": "https://www.biorxiv.org/content/10.64898/2026.10.18.759833v1.full",
  "id": "dccczvh040pry",
  "issns": [],
  "landing_url": "https://www.biorxiv.org/content/10.64898/2026.10.18.759833v1",
  "language": null,
  "licence": "CC-BY-NC-ND",
  "licence_label": "CC BY-NC-ND",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by-nc-nd/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "biorxiv",
      "bioinformatics"
    ],
    [
      "openalex",
      "1312|Protein Structure and Dynamics"
    ]
  ],
  "openalex": "W7223046557",
  "pdf_url": "https://www.biorxiv.org/content/10.64898/2026.10.18.759833v1.full.pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-18",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/dccczvh040pry.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:28:41Z",
      "native_id": "10.64898/2026.10.18.759833",
      "source": "biorxiv",
      "url": "https://www.biorxiv.org/content/10.64898/2026.10.18.759833v2"
    }
  ],
  "subjects": [
    {
      "field": "biology",
      "origin": "biorxiv:bioinformatics",
      "subfield": "bioinformatics"
    }
  ],
  "title": "BiHC: Protein domain segmentation by bidirectional hierarchical clustering using Voronoi tessellation and physical self-containment",
  "title_text": "BiHC: Protein domain segmentation by bidirectional hierarchical clustering using Voronoi tessellation and physical self-containment",
  "type": "preprint",
  "updated_at": "2026-11-01T00:20:36Z",
  "url": "https://research.draconitic.com/paper/dccczvh040pry",
  "venue": "bioRxiv",
  "versions": []
}