Parameterized Algorithms for the Spanning Forest Isomorphism and Containment on Tree
Uloženo v:
| Vydáno v: | Theoretical computer science s. 115652 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
01.11.2025
|
| ISSN: | 0304-3975 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| ArticleNumber | 115652 |
|---|---|
| Author | Shi, Feng Zheng, Yicheng Chen, Xian Liu, Jingyi Wang, Jianxin |
| Author_xml | – sequence: 1 givenname: Jingyi surname: Liu fullname: Liu, Jingyi – sequence: 2 givenname: Xian surname: Chen fullname: Chen, Xian – sequence: 3 givenname: Yicheng surname: Zheng fullname: Zheng, Yicheng – sequence: 4 givenname: Jianxin surname: Wang fullname: Wang, Jianxin – sequence: 5 givenname: Feng surname: Shi fullname: Shi, Feng |
| BookMark | eNot0L1uwjAYhWEPVCrQXkA330DSz38JGREqLRJSKzW7ZZzPJAjbyPbSXn1B9CzvdoZnQWYhBiTkhUHNgDWvp7rYXHPgqmZMNYrPyBwEyEp0rXoki5xPcJ1qmznpv0wyHgum6RcHuj4fY5rK6DN1MdEyIv2-mBCmcKTbmDAXusvRx3QZp-ypCQPdxFDMFDyGQmOgfUJ8Ig_OnDM-_3dJ-u1bv_mo9p_vu816X9lO8koJZ5Vj1nLJ-cowjgBMSgECcQUDkx1D01lAIR203IrD6gC2E7ZpReckF0vC7rc2xZwTOn1JkzfpRzPQNwl90lcJfZPQdwnxBzSPVqI |
| Cites_doi | 10.1007/s10878-013-9692-y 10.1089/cmb.2011.0254 10.1109/TCBB.2005.48 10.1137/080716475 10.1016/j.tcs.2019.04.003 10.1016/j.tcs.2021.06.036 10.1109/TKDE.2018.2831214 10.1007/s10878-010-9370-2 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2025.115652 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2025_115652 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9DU 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABAOU ABBOA ABDPE ABEFU ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AEXQZ AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ YNT ZMT ZY4 ~G- ~HD |
| ID | FETCH-LOGICAL-c942-53fc5f1cc24228a12e00144303ee80d1491ea9c0e34f072c3b8b0c93c6739f423 |
| ISSN | 0304-3975 |
| IngestDate | Thu Nov 27 01:05:20 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c942-53fc5f1cc24228a12e00144303ee80d1491ea9c0e34f072c3b8b0c93c6739f423 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2025_115652 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-11-00 |
| PublicationDateYYYYMMDD | 2025-11-01 |
| PublicationDate_xml | – month: 11 year: 2025 text: 2025-11-00 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2025 |
| References | You (10.1016/j.tcs.2025.115652_bib0001) 2020; 806 Chen (10.1016/j.tcs.2025.115652_bib0015) 2009; 38 Damaschke (10.1016/j.tcs.2025.115652_bib0009) 2008 Cygan (10.1016/j.tcs.2025.115652_bib0002) 2015; 5 Bulteau (10.1016/j.tcs.2025.115652_bib0011) 2014 Chen (10.1016/j.tcs.2025.115652_bib0007) 2005; 2 Jiang (10.1016/j.tcs.2025.115652_bib0010) 2012; 23 Aho (10.1016/j.tcs.2025.115652_bib0018) 1974 Brand (10.1016/j.tcs.2025.115652_bib0016) 2023 Kirkpatrick (10.1016/j.tcs.2025.115652_bib0004) 2012; 19 Ekim (10.1016/j.tcs.2025.115652_bib0019) 2024; abs/2401.09764 Baumbach (10.1016/j.tcs.2025.115652_bib0003) 2015; 29 Bulteau (10.1016/j.tcs.2025.115652_bib0008) 2013 Kul (10.1016/j.tcs.2025.115652_bib0006) 2018; 30 Jiang (10.1016/j.tcs.2025.115652_bib0012) 2014 Chen (10.1016/j.tcs.2025.115652_bib0020) 2022 Björklund (10.1016/j.tcs.2025.115652_bib0013) 2007 Shi (10.1016/j.tcs.2025.115652_bib0005) 2021; 886 Liu (10.1016/j.tcs.2025.115652_bib0017) 2025 Chen (10.1016/j.tcs.2025.115652_bib0014) 2007 |
| References_xml | – start-page: 266 year: 2025 ident: 10.1016/j.tcs.2025.115652_bib0017 article-title: Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems – volume: 29 start-page: 141 issue: 1 year: 2015 ident: 10.1016/j.tcs.2025.115652_bib0003 article-title: Covering tree with stars publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-013-9692-y – volume: 19 start-page: 998 issue: 9 year: 2012 ident: 10.1016/j.tcs.2025.115652_bib0004 article-title: Comparing Pedigree Graphs publication-title: Journal of Computational Biology doi: 10.1089/cmb.2011.0254 – volume: 2 start-page: 302 issue: 4 year: 2005 ident: 10.1016/j.tcs.2025.115652_bib0007 article-title: Assignment of Orthologous Genes via Genome Rearrangement publication-title: IEEE/ACM Transactions on Computational Biology and Bioinformatics doi: 10.1109/TCBB.2005.48 – start-page: 503 year: 2023 ident: 10.1016/j.tcs.2025.115652_bib0016 article-title: A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow – start-page: 67 year: 2007 ident: 10.1016/j.tcs.2025.115652_bib0013 article-title: Fourier meets möbius: fast subset convolution – volume: 38 start-page: 2526 issue: 6 year: 2009 ident: 10.1016/j.tcs.2025.115652_bib0015 article-title: Randomized divide-and-conquer: Improved path, matching, and packing algorithms publication-title: SIAM Journal on Computing doi: 10.1137/080716475 – start-page: 612 year: 2022 ident: 10.1016/j.tcs.2025.115652_bib0020 article-title: Maximum Flow and Minimum-Cost Flow in Almost-Linear Time – volume: 806 start-page: 256 year: 2020 ident: 10.1016/j.tcs.2025.115652_bib0001 article-title: Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2019.04.003 – start-page: 87 year: 2008 ident: 10.1016/j.tcs.2025.115652_bib0009 article-title: Minimum common string partition parameterized – start-page: 13 year: 2014 ident: 10.1016/j.tcs.2025.115652_bib0012 article-title: On the Exact Block Cover Problem – start-page: 102 year: 2014 ident: 10.1016/j.tcs.2025.115652_bib0011 article-title: Minimum common string partition parameterized by partition size is fixed-parameter tractable – volume: abs/2401.09764 year: 2024 ident: 10.1016/j.tcs.2025.115652_bib0019 article-title: Generation of weighted trees, block trees and block graphs publication-title: CoRR – start-page: 244 year: 2013 ident: 10.1016/j.tcs.2025.115652_bib0008 article-title: A fixed-parameter algorithm for minimum common string partition with few duplications – volume: 886 start-page: 3 year: 2021 ident: 10.1016/j.tcs.2025.115652_bib0005 article-title: Fixed-parameter tractability for the Tree Assembly problem publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2021.06.036 – volume: 30 start-page: 2408 issue: 12 year: 2018 ident: 10.1016/j.tcs.2025.115652_bib0006 article-title: Similarity Metrics for SQL Query Clustering publication-title: IEEE Transactions on Knowledge and Data Engineering doi: 10.1109/TKDE.2018.2831214 – volume: 5 year: 2015 ident: 10.1016/j.tcs.2025.115652_bib0002 – start-page: 298 year: 2007 ident: 10.1016/j.tcs.2025.115652_bib0014 article-title: Improved algorithms for path, matching, and packing problems – year: 1974 ident: 10.1016/j.tcs.2025.115652_bib0018 – volume: 23 start-page: 519 year: 2012 ident: 10.1016/j.tcs.2025.115652_bib0010 article-title: Minimum common string partition revisited publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-010-9370-2 |
| SSID | ssj0000576 |
| Score | 2.4559135 |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 115652 |
| Title | Parameterized Algorithms for the Spanning Forest Isomorphism and Containment on Tree |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211209 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Na9swGBZr00N32Efase4LHXZacJAly7aOYXSsYyuF-ZDtYixZblM6O8Rpyfbr98qSP9IxWA67mCCEYvw-vHokPXpehN4CBciJLJgndS69IJaBJyULvJwAO6dZqIRs3PU_R-fn8XwuLtztkropJxCVZbzZiOV_DTW0QbDN1dkdwt0NCg3wG4IOTwg7PP8p8BeZ0VsZC-ZfQCZnN5cVrP-vrO9CQzO_Lm2dookpy1mvJ2d19aOCz92WyzCGVZ1KoJwkK70lF0oGVx-VqwkxcRNpJ-9Z3DbwgH_5uegVBDbFzQeI_A5tTbL5ZiSpbhZt9vedUhj6bpw5uNuboNxd0utTGDPnLiLigxQJFDS0prV_ZG-7kXA9XStjpE75tO-77ZR9bwbrdIWtZO06hSFSM0Rqh9hDIxpxAWlvNDs7nX_qJ2se2eNs96LtwXcjAbz3HgPqMuAgyRP0yC0e8MwG_Sl6oMsxetwW5sAuT4_Rwy-dGW99hJItROAeERgQgaEjbhGBLSLwABEYEIEHiMBViQ0ijlHy4TR5_9FzxTQ8JQLqcVYoXvhKUeP5lvlUm8VxAARG65jksE72dSYU0SwoSEQVk7EkSjAVRkwUwLmfof2yKvVzhEPpU6k5ITLPAx2EcRz7RBIqiGKCs-wEvWs_U7q0linpXwPzYpfOL9Fhj7JXaH-9utWv0YG6Wy_q1RsX2t9aAGVx |
| linkProvider | Elsevier |
| 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=Parameterized+Algorithms+for+the+Spanning+Forest+Isomorphism+and+Containment+on+Tree&rft.jtitle=Theoretical+computer+science&rft.au=Liu%2C+Jingyi&rft.au=Chen%2C+Xian&rft.au=Zheng%2C+Yicheng&rft.au=Wang%2C+Jianxin&rft.date=2025-11-01&rft.issn=0304-3975&rft.spage=115652&rft_id=info:doi/10.1016%2Fj.tcs.2025.115652&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2025_115652 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |