Matches in SemOpenAlex for { <https://semopenalex.org/work/W4385483669> ?p ?o ?g. }
Showing items 1 to 98 of
98
with 100 items per page.
- W4385483669 endingPage "107296" @default.
- W4385483669 startingPage "107296" @default.
- W4385483669 abstract "In population medical genetics, the study of autosomal recessive disorders in highly endogamous populations is a major topic where calculating the inbreeding and relationship coefficients on mating networks is crucial. However, a challenge arises when dealing with large and complex mating networks, making their traversal difficult during the calculation process. For this calculation, we propose using Iterative Level-0 (IL0) as a new and faster algorithm that traverses mating networks more efficiently. The purpose of this work is to explain in detail the IL0 algorithm and prove its superiority by comparing it with two algorithms based on the best-known algorithms in the area: Depth First Search (DFS) and Breadth First Search (BFS). A Cytoscape application has been developed to calculate the inbreeding and relationship coefficients of individuals composing any mating network. In this application, the IL0 proposal together with DFS-based and BFS-based algorithms have been implemented. Any user can access this freely available Cytoscape application (https://apps.cytoscape.org/apps/inbreeding) that allows the comparison between the IL0 proposal and the best-known algorithms (based on DFS and BFS). In addition, a diverse set of mating networks has been collected in terms of complexity (number of edges) and species (humans, primates, and dogs) for the experiments. The runtime obtained by the IL0, DFS-based, and BFS-based algorithms when calculating the inbreeding and relationship coefficients proved the improvement of IL0. In fact, a speedup study reflected that the IL0 algorithm is 7.60 to 127.50 times faster than DFS-based and BFS-based algorithms. Moreover, a scalability study found that the growth of the IL0 runtime has a linear dependence on the number of edges of the mating network, while the DFS-based and BFS-based runtimes have a quadratic dependence. Therefore, the IL0 algorithm can solve the problem of calculating the inbreeding and relationship coefficients many times faster (up to 127.50) than the two algorithms based on the famous DFS and BFS. Furthermore, our results demonstrate that IL0 scales much better as the complexity of mating networks increases." @default.
- W4385483669 created "2023-08-03" @default.
- W4385483669 creator A5026267345 @default.
- W4385483669 creator A5046423361 @default.
- W4385483669 creator A5049408851 @default.
- W4385483669 date "2023-09-01" @default.
- W4385483669 modified "2023-10-18" @default.
- W4385483669 title "Iterative Level-0: A new and fast algorithm to traverse mating networks calculating the inbreeding and relationship coefficients" @default.
- W4385483669 cites W1643717963 @default.
- W4385483669 cites W1850372942 @default.
- W4385483669 cites W1952912025 @default.
- W4385483669 cites W1965821920 @default.
- W4385483669 cites W1997424334 @default.
- W4385483669 cites W2002028392 @default.
- W4385483669 cites W2065035179 @default.
- W4385483669 cites W2077206887 @default.
- W4385483669 cites W2101007211 @default.
- W4385483669 cites W2102238984 @default.
- W4385483669 cites W2139787612 @default.
- W4385483669 cites W2139810621 @default.
- W4385483669 cites W2151742524 @default.
- W4385483669 cites W2159612247 @default.
- W4385483669 cites W2159675211 @default.
- W4385483669 cites W2169489534 @default.
- W4385483669 cites W2171739259 @default.
- W4385483669 cites W2558388086 @default.
- W4385483669 cites W2590562467 @default.
- W4385483669 cites W2605402590 @default.
- W4385483669 cites W2790487477 @default.
- W4385483669 cites W2810626510 @default.
- W4385483669 cites W2939357170 @default.
- W4385483669 cites W2943355970 @default.
- W4385483669 cites W2993982964 @default.
- W4385483669 cites W3020685134 @default.
- W4385483669 cites W3110675620 @default.
- W4385483669 cites W3165206372 @default.
- W4385483669 cites W3197783964 @default.
- W4385483669 cites W3199676517 @default.
- W4385483669 cites W3202638942 @default.
- W4385483669 doi "https://doi.org/10.1016/j.compbiomed.2023.107296" @default.
- W4385483669 hasPubMedId "https://pubmed.ncbi.nlm.nih.gov/37566933" @default.
- W4385483669 hasPublicationYear "2023" @default.
- W4385483669 type Work @default.
- W4385483669 citedByCount "0" @default.
- W4385483669 crossrefType "journal-article" @default.
- W4385483669 hasAuthorship W4385483669A5026267345 @default.
- W4385483669 hasAuthorship W4385483669A5046423361 @default.
- W4385483669 hasAuthorship W4385483669A5049408851 @default.
- W4385483669 hasConcept C11413529 @default.
- W4385483669 hasConcept C116402615 @default.
- W4385483669 hasConcept C13280743 @default.
- W4385483669 hasConcept C144024400 @default.
- W4385483669 hasConcept C149923435 @default.
- W4385483669 hasConcept C152043487 @default.
- W4385483669 hasConcept C176809094 @default.
- W4385483669 hasConcept C205649164 @default.
- W4385483669 hasConcept C2777782036 @default.
- W4385483669 hasConcept C2908647359 @default.
- W4385483669 hasConcept C38652104 @default.
- W4385483669 hasConcept C41008148 @default.
- W4385483669 hasConcept C514575182 @default.
- W4385483669 hasConcept C54355233 @default.
- W4385483669 hasConcept C86803240 @default.
- W4385483669 hasConceptScore W4385483669C11413529 @default.
- W4385483669 hasConceptScore W4385483669C116402615 @default.
- W4385483669 hasConceptScore W4385483669C13280743 @default.
- W4385483669 hasConceptScore W4385483669C144024400 @default.
- W4385483669 hasConceptScore W4385483669C149923435 @default.
- W4385483669 hasConceptScore W4385483669C152043487 @default.
- W4385483669 hasConceptScore W4385483669C176809094 @default.
- W4385483669 hasConceptScore W4385483669C205649164 @default.
- W4385483669 hasConceptScore W4385483669C2777782036 @default.
- W4385483669 hasConceptScore W4385483669C2908647359 @default.
- W4385483669 hasConceptScore W4385483669C38652104 @default.
- W4385483669 hasConceptScore W4385483669C41008148 @default.
- W4385483669 hasConceptScore W4385483669C514575182 @default.
- W4385483669 hasConceptScore W4385483669C54355233 @default.
- W4385483669 hasConceptScore W4385483669C86803240 @default.
- W4385483669 hasLocation W43854836691 @default.
- W4385483669 hasLocation W43854836692 @default.
- W4385483669 hasOpenAccess W4385483669 @default.
- W4385483669 hasPrimaryLocation W43854836691 @default.
- W4385483669 hasRelatedWork W157336430 @default.
- W4385483669 hasRelatedWork W1941665791 @default.
- W4385483669 hasRelatedWork W1972555882 @default.
- W4385483669 hasRelatedWork W1976076599 @default.
- W4385483669 hasRelatedWork W2023395610 @default.
- W4385483669 hasRelatedWork W2124484202 @default.
- W4385483669 hasRelatedWork W2357872481 @default.
- W4385483669 hasRelatedWork W2808999906 @default.
- W4385483669 hasRelatedWork W4236833771 @default.
- W4385483669 hasRelatedWork W4385483669 @default.
- W4385483669 hasVolume "164" @default.
- W4385483669 isParatext "false" @default.
- W4385483669 isRetracted "false" @default.
- W4385483669 workType "article" @default.