Algorithms for comparing large pedigree graphs
The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing information of individuals are considered obstacles in deducing pedigrees, especially larger ones. Therefore, the reconstructed pedigree graph ev...
Gespeichert in:
| Veröffentlicht in: | Advances in Computing and Engineering Jg. 2; H. 1; S. 43 - 59 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Academy Publishing Center
30.06.2022
|
| Schlagworte: | |
| ISSN: | 2735-5977, 2735-5985 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing information of individuals are considered obstacles in deducing pedigrees, especially larger ones. Therefore, the reconstructed pedigree graph evaluation needs to be undertaken for relevant diagnosis. This requires a comparison between the derived and the original data. The present study discusses the isomorphism of huge pedigrees with labeled and unlabeled leaves, where a pedigree has hundreds of families, which are monogamous and generational. The algorithms presented in this paper are based on a set of bipartite graphs covering the pedigree and the problem addressed is parameter tractable. The Bipartite graphs Covering the Pedigree (BCP) problem is said to possess a time complexity of $f(k).mod(X)^{O(1)}$ where $f$ is the computing function that grows exponentially. The study presents an algorithm for the BCP problem that can be categorized as a polynomial-time-tractable evaluation of the reconstructed pedigree. The paper considers pedigree graphs that consist of both labeled and unlabeled leaves that make use of parameterized and kernelization algorithms to solve the problem. The kernelization algorithm executes in $O(k^3)$ for the BCP graphs. |
|---|---|
| AbstractList | The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing information of individuals are considered obstacles in deducing pedigrees, especially larger ones. Therefore, the reconstructed pedigree graph evaluation needs to be undertaken for relevant diagnosis. This requires a comparison between the derived and the original data. The present study discusses the isomorphism of huge pedigrees with labeled and unlabeled leaves, where a pedigree has hundreds of families, which are monogamous and generational. The algorithms presented in this paper are based on a set of bipartite graphs covering the pedigree and the problem addressed is parameter tractable. The Bipartite graphs Covering the Pedigree (BCP) problem is said to possess a time complexity of $f(k).mod(X)^{O(1)}$ where $f$ is the computing function that grows exponentially. The study presents an algorithm for the BCP problem that can be categorized as a polynomial-time-tractable evaluation of the reconstructed pedigree. The paper considers pedigree graphs that consist of both labeled and unlabeled leaves that make use of parameterized and kernelization algorithms to solve the problem. The kernelization algorithm executes in $O(k^3)$ for the BCP graphs. |
| Author | Belal, Nahla A. Sherief, Hany H. Amar, Lamiaa A. |
| Author_xml | – sequence: 1 givenname: Nahla A. surname: Belal fullname: Belal, Nahla A. – sequence: 2 givenname: Lamiaa A. surname: Amar fullname: Amar, Lamiaa A. – sequence: 3 givenname: Hany H. surname: Sherief fullname: Sherief, Hany H. |
| BookMark | eNo90LtuwjAUxnGrolIp5QU65QWS2sf3EaFekJC6tLN14ksICjhyWPr2pVAxnU9n-A3_RzI75mMk5JnRBpgCeEEfG6AADYWGNVTwOzIHzWUtrZGz29b6gSynaU8pBQvcGjYnzWroculPu8NUpVwqnw8jlv7YVQOWLlZjDH1XYqy6guNueiL3CYcpLv_vgny_vX6tP-rt5_tmvdrWnknOa-BorAAGICLKFq31RvGgqDCgLFpUFBIooRLFIGIQxuqQWqW51hyE5Quyuboh496NpT9g-XEZe3d55NI5LKfeD9G1jCWlZAuQUHgW2pYFKYz3UiCkkM4WXC1f8jSVmG4eo-4S0J0Dur-AjoJj7hyQ_wKufGQV |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.21622/ace.2022.02.1.043 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 2735-5985 |
| EndPage | 59 |
| ExternalDocumentID | oai_doaj_org_article_b11f665b22fa4c1dbb1d548cc54a2fdf 10_21622_ace_2022_02_1_043 |
| GroupedDBID | AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ |
| ID | FETCH-LOGICAL-c1533-23a89421224ea5ba99c863d6048269a9a602f2646f0ad4ed4897dfb6737732493 |
| IEDL.DBID | DOA |
| ISSN | 2735-5977 |
| IngestDate | Fri Oct 03 12:44:06 EDT 2025 Sat Nov 29 06:22:10 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1533-23a89421224ea5ba99c863d6048269a9a602f2646f0ad4ed4897dfb6737732493 |
| OpenAccessLink | https://doaj.org/article/b11f665b22fa4c1dbb1d548cc54a2fdf |
| PageCount | 17 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_b11f665b22fa4c1dbb1d548cc54a2fdf crossref_primary_10_21622_ace_2022_02_1_043 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-06-30 |
| PublicationDateYYYYMMDD | 2022-06-30 |
| PublicationDate_xml | – month: 06 year: 2022 text: 2022-06-30 day: 30 |
| PublicationDecade | 2020 |
| PublicationTitle | Advances in Computing and Engineering |
| PublicationYear | 2022 |
| Publisher | Academy Publishing Center |
| Publisher_xml | – name: Academy Publishing Center |
| SSID | ssj0002923981 |
| Score | 2.1864972 |
| Snippet | The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| StartPage | 43 |
| SubjectTerms | isomorphism kernelization algorithms parameterized algorithm pedigree graphs |
| Title | Algorithms for comparing large pedigree graphs |
| URI | https://doaj.org/article/b11f665b22fa4c1dbb1d548cc54a2fdf |
| Volume | 2 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2735-5985 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002923981 issn: 2735-5977 databaseCode: DOA dateStart: 20210101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NSwMxEA1SPHgRRcX6xR68ybab2Ww2OVaxeJDiQaG3kE8Valv64e93ZrdKPXnxGsKSvCGZ98jsG8auS6dKWUqbe8FTLgQeKQfc5lUqrFAphmgbn9nHejRS47F-2mr1RTVhrT1wC1zfcZ6krBxAssLz4BwPyLK9r4SFFBLdvsh6tsQU3cGgydeO1Bam5yonk7X2jxngEqBvPTlkApBdJ-8VovyVlbbM-5ssMzxg-xt6mA3aZR2ynTg9Yr3B5HWGIv7tY5khx8zaunHMOdmE6rizOSYglM0xa9ynl8fsZXj_fPeQb_oc5J7YVg6lVZpeZkFEWzmrtVeyDBIPF0httZUFJCQuEvELIgahdB2Sow4zNfIhXZ6wznQ2jacsSyJIB0oWEamGrSPKN5Q0sapUrHHcddnN9z7NvLWzMCgDGlQMomIIFVOA4QZR6bJbguJnJllRNwMYILMJkPkrQGf_8ZFztkcrawv1LlhntVjHS7brP1fvy8VVE_sv1Piwfw |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Algorithms+for+comparing+large+pedigree+graphs&rft.jtitle=Advances+in+Computing+and+Engineering&rft.au=Nahla+A.+Belal&rft.au=Lamiaa+A.+Amar&rft.au=Hany+H.+Sherief&rft.date=2022-06-30&rft.pub=Academy+Publishing+Center&rft.issn=2735-5977&rft.eissn=2735-5985&rft.volume=2&rft.issue=1&rft.spage=43&rft.epage=59&rft_id=info:doi/10.21622%2Face.2022.02.1.043&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_b11f665b22fa4c1dbb1d548cc54a2fdf |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2735-5977&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2735-5977&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2735-5977&client=summon |