The Structure of Bit-String Similarity Networks
We study the structural properties of networks formed by random sets of bit strings—namely the ordered arrays of binary variables representing, for instance, genetic information or cultural profiles. Two bit strings are connected by a network link when they are sufficiently similar to each other, i....
Saved in:
Main Authors: | David M. Schneider, Damián H. Zanette |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-01-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/27/1/57 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient top-k string similarity query algorithms
by: Zi-yang CHEN, et al.
Published: (2014-12-01) -
A design method of large-scale partial similar model test for cementing casing string system
by: Linshan Qi, et al.
Published: (2025-01-01) -
HashTrie:a space-efficient multiple string matching algorithm
by: Ping ZHANG, et al.
Published: (2015-10-01) -
Experimental and Analytical Studies of String Steel Structure for Bridges
by: Edmundas Beivydas, et al.
Published: (2023-12-01) -
STRUCTURAL OPTIMIZATION AND FATIGUE LIFE STUDY OF AIR HAMMER BIT
by: FENG ChunYu, et al.
Published: (2024-04-01)