Kernelizations for the hybridization number problem on multiple nonbinary trees

Given a finite set X, a collection T of rooted phylogenetic trees on X and an integer k, the Hybridization Number problem asks if there exists a phylogenetic network on X that displays all trees from T and has reticulation number at most k. We show two kernelization algorithms for Hybridization Numb...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of computer and system sciences Ročník 82; číslo 6; s. 1075 - 1089
Hlavní autori:	van Iersel, Leo, Kelk, Steven, Scornavacca, Celine
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.09.2016 Elsevier
Predmet:	Algorithms Bioinformatics Collection Computer Science Computer simulation Displays Fixed-parameter tractability Hybridization number Kernelization Kernels Mathematical analysis Mathematical models Phylogenetic network Phylogenetic tree Trees Hybridization number Phylogenetic network Fixed-parameter tractability Phylogenetic tree Kernelization phylogenetic network phylogenetic tree hybridization number kernelization
ISSN:	0022-0000, 1090-2724
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	Given a finite set X, a collection T of rooted phylogenetic trees on X and an integer k, the Hybridization Number problem asks if there exists a phylogenetic network on X that displays all trees from T and has reticulation number at most k. We show two kernelization algorithms for Hybridization Number, with kernel sizes 4k(5k)t and 20k2(Δ+−1) respectively, with t the number of input trees and Δ+ their maximum outdegree. Experiments on simulated data demonstrate the practical relevance of our kernelization algorithms. In addition, we present an nf(k)t-time algorithm, with n=\|X\| and f some computable function of k. •We study constructing a network displaying a given collection of phylogenetic trees.•Our kernelization techniques work for inputs consisting of multiple binary trees.•Previous results were restricted to two trees and/or binary trees.•A unified and simplified approach for dealing with common chains of nonbinary trees.•Polynomial-time solvability with fixed number of reticulations.
AbstractList	Given a finite set X, a collection T of rooted phylogenetic trees on X and an integer k, the Hybridization Number problem asks if there exists a phylogenetic network on X that displays all trees from T and has reticulation number at most k. We show two kernelization algorithms for Hybridization Number, with kernel sizes 4k(5k)t and 20k2(Δ+−1) respectively, with t the number of input trees and Δ+ their maximum outdegree. Experiments on simulated data demonstrate the practical relevance of our kernelization algorithms. In addition, we present an nf(k)t-time algorithm, with n=\|X\| and f some computable function of k. •We study constructing a network displaying a given collection of phylogenetic trees.•Our kernelization techniques work for inputs consisting of multiple binary trees.•Previous results were restricted to two trees and/or binary trees.•A unified and simplified approach for dealing with common chains of nonbinary trees.•Polynomial-time solvability with fixed number of reticulations. Given a finite set X , a collection TT of rooted phylogenetic trees on X and an integer k, the Hybridization Number problem asks if there exists a phylogenetic network on X that displays all trees from TT and has reticulation number at most k. We show two kernelization algorithms for Hybridization Number, with kernel sizes 4k(5k) super(t)4k(5k)t and 20k super(2)( Delta super(+)-1)20k2( Delta +-1 ) respectively, with t the number of input trees and Delta super(+) Delta + their maximum outdegree. Experiments on simulated data demonstrate the practical relevance of our kernelization algorithms. In addition, we present an n super(f(k))tnf(k)t-time algorithm, with n=\|X\|n=\|X\| and f some computable function of k. Given a finite set X, a collection T of rooted phylogenetic trees on X and an integer k, the Hybridization Number problem asks if there exists a phylogenetic network on X that displays all trees from T and has reticulation number at most k. We show two kernelization algorithms for Hybridization Number, with kernel sizes 4k(5k) t and 20k 2 (∆ + − 1) respectively, with t the number of input trees and ∆ + their maximum outdegree. Experiments on simulated data demonstrate the practical relevance of our kernelization algorithms. In addition, we present an n f (k) t-time algorithm, with n = \|X\| and f some computable function of k.
Author	van Iersel, Leo Kelk, Steven Scornavacca, Celine
Author_xml	– sequence: 1 givenname: Leo surname: van Iersel fullname: van Iersel, Leo email: l.j.j.v.iersel@gmail.com organization: Delft Institute of Applied Mathematics, Delft University of Technology, P.O. Box 5, 2600 AA Delft, The Netherlands – sequence: 2 givenname: Steven surname: Kelk fullname: Kelk, Steven email: steven.kelk@maastrichtuniversity.nl organization: Department of Knowledge Engineering (DKE), Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands – sequence: 3 givenname: Celine surname: Scornavacca fullname: Scornavacca, Celine email: celine.scornavacca@univ-montp2.fr organization: ISEM, Université de Montpellier, CNRS, IRD, EPHE, Place Eugène Bataillon, 34095, Montpellier, France
BackLink	https://hal.science/hal-02154926$$DView record in HAL
BookMark	eNp9kEtLAzEUhYMoWB9_wNUsdTHjTSbzAjelqBUL3eg6JJk7NCUzU5NU0F9vauvGRe8m4XDO4fBdkNNhHJCQGwoZBVrer7O19j5j8Z9BngGUJ2RCoYGUVYyfkgkAYynEOycX3q8BKC3KfEKWr-gGtOZbBjMOPulGl4QVJqsv5Ux7kJNh2yt0ycaNymKfRKXf2mA2FpM4RJlBuq8kOER_Rc46aT1eH95L8v70-Dabp4vl88tsukg1r2lIK141XUs7KBVrlapRMloUCBXnZa4kgxwrXdVN0ULLOtBKImslZ0U8VSueX5K7fe9KWrFxpo8LxCiNmE8XYqdBLOQNKz9p9N7uvXH_xxZ9EL3xGq2VA45bL2gde3nD8zxa671Vu9F7h53QJvwyCE4aKyiIHW-xFjveYsdbQC4i7xhl_6J_s46GHvYhjKw-DTrhtcFBY2sc6iDa0RyL_wAezZw1
CitedBy_id	crossref_primary_10_1137_18M122724X crossref_primary_10_1007_s10479_021_04352_1 crossref_primary_10_1007_s00453_022_00946_8 crossref_primary_10_1007_s00285_019_01405_9 crossref_primary_10_1016_j_ipl_2022_106336 crossref_primary_10_1007_s00453_021_00914_8 crossref_primary_10_1007_s00453_017_0366_5 crossref_primary_10_1016_j_tcs_2018_04_004 crossref_primary_10_3390_a12120256
Cites_doi	10.1016/j.ipl.2013.02.010 10.1016/j.tig.2013.05.007 10.1137/110845045 10.1109/TCBB.2012.134 10.1109/TCBB.2011.137 10.1016/0025-5564(90)90123-G 10.1093/bioinformatics/btr618 10.1137/S0097539704446529 10.1137/120864350 10.1007/978-3-540-39763-2_22 10.1109/tcbb.2007.1019 10.1016/j.jcss.2009.04.001 10.1007/s00285-005-0315-9 10.1089/cmb.2013.0072 10.1007/s00453-012-9708-5 10.1137/120903567 10.1089/cmb.2012.0240 10.1093/sysbio/46.3.523 10.1093/bioinformatics/btq198 10.1353/lan.2005.0078 10.1016/j.dam.2006.08.008 10.1109/TCBB.2008.86 10.1007/s00026-015-0260-2
ContentType	Journal Article
Copyright	2016 Elsevier Inc. Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: 2016 Elsevier Inc. – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES
DOI	10.1016/j.jcss.2016.03.006
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1090-2724
EndPage	1089
ExternalDocumentID	oai:HAL:hal-02154926v1 10_1016_j_jcss_2016_03_006 S0022000016300010
GrantInformation_xml	– fundername: Netherlands Organisation for Scientific Research grantid: 639.071.106 funderid: http://dx.doi.org/10.13039/501100003246 – fundername: CNRS grantid: 230310 funderid: http://dx.doi.org/10.13039/501100004794
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES
ID	FETCH-LOGICAL-c481t-7479fd1f06b2dbb8ea2155e074463ba203e7c7895d0d2f0cbae2da425555b8b43
ISICitedReferencesCount	14
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000378465000006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0022-0000
IngestDate	Tue Oct 14 20:43:43 EDT 2025 Sat Sep 27 23:14:53 EDT 2025 Sat Nov 29 04:16:28 EST 2025 Tue Nov 18 20:43:02 EST 2025 Fri Feb 23 02:19:42 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	6
Keywords	Hybridization number Phylogenetic network Fixed-parameter tractability Phylogenetic tree Kernelization phylogenetic network phylogenetic tree hybridization number kernelization
Language	English
License	Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c481t-7479fd1f06b2dbb8ea2155e074463ba203e7c7895d0d2f0cbae2da425555b8b43
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
ORCID	0009-0004-0179-9771
OpenAccessLink	https://hal.science/hal-02154926
PQID	1825549433
PQPubID	23500
PageCount	15
ParticipantIDs	hal_primary_oai_HAL_hal_02154926v1 proquest_miscellaneous_1825549433 crossref_citationtrail_10_1016_j_jcss_2016_03_006 crossref_primary_10_1016_j_jcss_2016_03_006 elsevier_sciencedirect_doi_10_1016_j_jcss_2016_03_006
PublicationCentury	2000
PublicationDate	September 2016 2016-09-00 20160901 2016-09
PublicationDateYYYYMMDD	2016-09-01
PublicationDate_xml	– month: 09 year: 2016 text: September 2016
PublicationDecade	2010
PublicationTitle	Journal of computer and system sciences
PublicationYear	2016
Publisher	Elsevier Inc Elsevier
Publisher_xml	– name: Elsevier Inc – name: Elsevier
References	Bordewich, Semple (br0060) 2007; 4 Chen, Wang (br0080) 2013; 20 Wu (br0300) 2013; 20 McDiarmid, Semple, Welsh (br0220) 2015; 19 Piovesan, Kelk (br0250) 2013; 10 Semple, Steel (br0260) 2003 Kelk, Scornavacca (br0190) 2014; 68 Wu (br0290) 2010; 26 van Iersel (br0120) 2009 Albrecht, Scornavacca, Cenci, Huson (br0010) 2012; 28 Maddison (br0210) 1997; 46 Bordewich, Semple (br0050) 2007; 155 Morrison (br0230) 2011 Bapteste, van Iersel, Janke, Kelchner, Kelk, McInerney, Morrison, Nakhleh, Steel, Stougie, Whitfield (br0020) 2013; 29 Bodlaender, Downey, Fellows, Hermelin (br0040) 2009; 75 Jansson, Nguyen, Sung (br0160) 2006; 35 van Iersel, Linz (br0150) 2013; 113 Kelk, Scornavacca (br0180) 2012 Downey, Fellows (br0090) 1999 Baroni, Grünewald, Moulton, Semple (br0030) 2005; 51 Kelk, van Iersel, Lekić, Linz, Scornavacca, Stougie (br0170) 2012; 26 Chen, Wang (br0070) 2012; 9 van Iersel, Kelk, Lekić, Stougie (br0130) 2014; 28 van Iersel, Kelk, Lekić, Whidden, Zeh (br0140) 2014 Linz, Semple (br0200) 2009; 6 Huson, Rupp, Scornavacca (br0110) 2011 Whidden, Beiko, Zeh (br0280) 2013; 42 Nakhleh, Ringe, Warnow (br0240) 2005; 81 Song, Hein (br0270) 2003; 2812 Hein (br0100) 1990; 98 van Iersel (10.1016/j.jcss.2016.03.006_br0140) McDiarmid (10.1016/j.jcss.2016.03.006_br0220) 2015; 19 Huson (10.1016/j.jcss.2016.03.006_br0110) 2011 Maddison (10.1016/j.jcss.2016.03.006_br0210) 1997; 46 Downey (10.1016/j.jcss.2016.03.006_br0090) 1999 Kelk (10.1016/j.jcss.2016.03.006_br0170) 2012; 26 Kelk (10.1016/j.jcss.2016.03.006_br0190) 2014; 68 Jansson (10.1016/j.jcss.2016.03.006_br0160) 2006; 35 Linz (10.1016/j.jcss.2016.03.006_br0200) 2009; 6 van Iersel (10.1016/j.jcss.2016.03.006_br0120) 2009 Chen (10.1016/j.jcss.2016.03.006_br0070) 2012; 9 Morrison (10.1016/j.jcss.2016.03.006_br0230) 2011 Bapteste (10.1016/j.jcss.2016.03.006_br0020) 2013; 29 Baroni (10.1016/j.jcss.2016.03.006_br0030) 2005; 51 Whidden (10.1016/j.jcss.2016.03.006_br0280) 2013; 42 Wu (10.1016/j.jcss.2016.03.006_br0290) 2010; 26 Albrecht (10.1016/j.jcss.2016.03.006_br0010) 2012; 28 Chen (10.1016/j.jcss.2016.03.006_br0080) 2013; 20 Piovesan (10.1016/j.jcss.2016.03.006_br0250) 2013; 10 Semple (10.1016/j.jcss.2016.03.006_br0260) 2003 Bordewich (10.1016/j.jcss.2016.03.006_br0050) 2007; 155 Wu (10.1016/j.jcss.2016.03.006_br0300) 2013; 20 Kelk (10.1016/j.jcss.2016.03.006_br0180) Nakhleh (10.1016/j.jcss.2016.03.006_br0240) 2005; 81 Hein (10.1016/j.jcss.2016.03.006_br0100) 1990; 98 van Iersel (10.1016/j.jcss.2016.03.006_br0150) 2013; 113 Bodlaender (10.1016/j.jcss.2016.03.006_br0040) 2009; 75 Bordewich (10.1016/j.jcss.2016.03.006_br0060) 2007; 4 van Iersel (10.1016/j.jcss.2016.03.006_br0130) 2014; 28 Song (10.1016/j.jcss.2016.03.006_br0270) 2003; 2812
References_xml	– volume: 35 start-page: 1098 year: 2006 end-page: 1121 ident: br0160 article-title: Algorithms for combining rooted triplets into a galled phylogenetic network publication-title: SIAM J. Comput. – year: 2012 ident: br0180 article-title: Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees – volume: 10 start-page: 18 year: 2013 end-page: 25 ident: br0250 article-title: A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. – volume: 20 start-page: 792 year: 2013 end-page: 804 ident: br0300 article-title: An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees publication-title: J. Comput. Biol. – volume: 155 start-page: 914 year: 2007 end-page: 928 ident: br0050 article-title: Computing the minimum number of hybridization events for a consistent evolutionary history publication-title: Discrete Appl. Math. – volume: 26 start-page: i140 year: 2010 end-page: i148 ident: br0290 article-title: Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees publication-title: Bioinformatics – volume: 9 start-page: 372 year: 2012 end-page: 384 ident: br0070 article-title: Algorithms for reticulate networks of multiple phylogenetic trees publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. – year: 2009 ident: br0120 article-title: Algorithms, haplotypes and phylogenetic networks – year: 1999 ident: br0090 article-title: Parameterized Complexity – volume: 19 start-page: 205 year: 2015 end-page: 224 ident: br0220 article-title: Counting phylogenetic networks publication-title: Ann. Comb. – volume: 28 start-page: 49 year: 2014 end-page: 66 ident: br0130 article-title: Approximation algorithms for nonbinary agreement forests publication-title: SIAM J. Discrete Math. – year: 2003 ident: br0260 article-title: Phylogenetics – volume: 113 start-page: 318 year: 2013 end-page: 323 ident: br0150 article-title: A quadratic kernel for computing the hybridization number of multiple trees publication-title: Inf. Process. Lett. – volume: 42 start-page: 1431 year: 2013 end-page: 1466 ident: br0280 article-title: Fixed-parameter algorithms for maximum agreement forests publication-title: SIAM J. Comput. – volume: 75 start-page: 423 year: 2009 end-page: 434 ident: br0040 article-title: On problems without polynomial kernels publication-title: J. Comput. Syst. Sci. – volume: 4 start-page: 458 year: 2007 end-page: 466 ident: br0060 article-title: Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. – volume: 46 start-page: 523 year: 1997 end-page: 536 ident: br0210 article-title: Gene trees in species trees publication-title: Syst. Biol. – volume: 98 start-page: 185 year: 1990 end-page: 200 ident: br0100 article-title: Reconstructing evolution of sequences subject to recombination using parsimony publication-title: Math. Biosci. – volume: 51 start-page: 171 year: 2005 end-page: 182 ident: br0030 article-title: Bounding the number of hybridisation events for a consistent evolutionary history publication-title: Math. Biol. – year: 2011 ident: br0110 article-title: Phylogenetic Networks: Concepts, Algorithms and Applications – year: 2014 ident: br0140 article-title: Hybridization number on three trees – volume: 29 start-page: 439 year: 2013 end-page: 441 ident: br0020 article-title: Networks: expanding evolutionary thinking publication-title: Trends Genet. – volume: 81 start-page: 382 year: 2005 end-page: 420 ident: br0240 article-title: Perfect phylogenetic networks: a new methodology for reconstructing the evolutionary history of natural languages publication-title: Language – volume: 20 start-page: 38 year: 2013 end-page: 41 ident: br0080 article-title: An ultrafast tool for minimum reticulate networks publication-title: J. Comput. Biol. – volume: 28 start-page: 191 year: 2012 end-page: 197 ident: br0010 article-title: Fast computation of minimum hybridization networks publication-title: Bioinformatics – year: 2011 ident: br0230 article-title: Introduction to Phylogenetic Networks – volume: 26 start-page: 1635 year: 2012 end-page: 1656 ident: br0170 article-title: Cycle killer…qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set publication-title: SIAM J. Discrete Math. – volume: 68 start-page: 886 year: 2014 end-page: 915 ident: br0190 article-title: Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable publication-title: Algorithmica – volume: 6 start-page: 30 year: 2009 end-page: 45 ident: br0200 article-title: Hybridization in non-binary trees publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. – volume: 2812 start-page: 287 year: 2003 end-page: 302 ident: br0270 article-title: Parsimonious reconstruction of sequence evolution and haplotyde blocks: finding the minimum number of recombination events publication-title: Algorithms Bioinform. (WABI 2003) – year: 2003 ident: 10.1016/j.jcss.2016.03.006_br0260 – volume: 113 start-page: 318 issue: 9 year: 2013 ident: 10.1016/j.jcss.2016.03.006_br0150 article-title: A quadratic kernel for computing the hybridization number of multiple trees publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2013.02.010 – volume: 29 start-page: 439 issue: 8 year: 2013 ident: 10.1016/j.jcss.2016.03.006_br0020 article-title: Networks: expanding evolutionary thinking publication-title: Trends Genet. doi: 10.1016/j.tig.2013.05.007 – volume: 42 start-page: 1431 issue: 4 year: 2013 ident: 10.1016/j.jcss.2016.03.006_br0280 article-title: Fixed-parameter algorithms for maximum agreement forests publication-title: SIAM J. Comput. doi: 10.1137/110845045 – year: 2011 ident: 10.1016/j.jcss.2016.03.006_br0110 – volume: 10 start-page: 18 issue: 1 year: 2013 ident: 10.1016/j.jcss.2016.03.006_br0250 article-title: A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2012.134 – volume: 9 start-page: 372 issue: 2 year: 2012 ident: 10.1016/j.jcss.2016.03.006_br0070 article-title: Algorithms for reticulate networks of multiple phylogenetic trees publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2011.137 – volume: 98 start-page: 185 issue: 2 year: 1990 ident: 10.1016/j.jcss.2016.03.006_br0100 article-title: Reconstructing evolution of sequences subject to recombination using parsimony publication-title: Math. Biosci. doi: 10.1016/0025-5564(90)90123-G – volume: 28 start-page: 191 issue: 2 year: 2012 ident: 10.1016/j.jcss.2016.03.006_br0010 article-title: Fast computation of minimum hybridization networks publication-title: Bioinformatics doi: 10.1093/bioinformatics/btr618 – volume: 35 start-page: 1098 issue: 5 year: 2006 ident: 10.1016/j.jcss.2016.03.006_br0160 article-title: Algorithms for combining rooted triplets into a galled phylogenetic network publication-title: SIAM J. Comput. doi: 10.1137/S0097539704446529 – year: 2009 ident: 10.1016/j.jcss.2016.03.006_br0120 – volume: 26 start-page: 1635 issue: 4 year: 2012 ident: 10.1016/j.jcss.2016.03.006_br0170 article-title: Cycle killer…qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set publication-title: SIAM J. Discrete Math. doi: 10.1137/120864350 – ident: 10.1016/j.jcss.2016.03.006_br0180 – year: 2011 ident: 10.1016/j.jcss.2016.03.006_br0230 – volume: 2812 start-page: 287 year: 2003 ident: 10.1016/j.jcss.2016.03.006_br0270 article-title: Parsimonious reconstruction of sequence evolution and haplotyde blocks: finding the minimum number of recombination events publication-title: Algorithms Bioinform. (WABI 2003) doi: 10.1007/978-3-540-39763-2_22 – volume: 4 start-page: 458 issue: 3 year: 2007 ident: 10.1016/j.jcss.2016.03.006_br0060 article-title: Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/tcbb.2007.1019 – volume: 75 start-page: 423 issue: 8 year: 2009 ident: 10.1016/j.jcss.2016.03.006_br0040 article-title: On problems without polynomial kernels publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2009.04.001 – volume: 51 start-page: 171 year: 2005 ident: 10.1016/j.jcss.2016.03.006_br0030 article-title: Bounding the number of hybridisation events for a consistent evolutionary history publication-title: Math. Biol. doi: 10.1007/s00285-005-0315-9 – volume: 20 start-page: 792 issue: 10 year: 2013 ident: 10.1016/j.jcss.2016.03.006_br0300 article-title: An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees publication-title: J. Comput. Biol. doi: 10.1089/cmb.2013.0072 – volume: 68 start-page: 886 year: 2014 ident: 10.1016/j.jcss.2016.03.006_br0190 article-title: Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable publication-title: Algorithmica doi: 10.1007/s00453-012-9708-5 – volume: 28 start-page: 49 issue: 1 year: 2014 ident: 10.1016/j.jcss.2016.03.006_br0130 article-title: Approximation algorithms for nonbinary agreement forests publication-title: SIAM J. Discrete Math. doi: 10.1137/120903567 – volume: 20 start-page: 38 issue: 1 year: 2013 ident: 10.1016/j.jcss.2016.03.006_br0080 article-title: An ultrafast tool for minimum reticulate networks publication-title: J. Comput. Biol. doi: 10.1089/cmb.2012.0240 – ident: 10.1016/j.jcss.2016.03.006_br0140 – volume: 46 start-page: 523 issue: 3 year: 1997 ident: 10.1016/j.jcss.2016.03.006_br0210 article-title: Gene trees in species trees publication-title: Syst. Biol. doi: 10.1093/sysbio/46.3.523 – volume: 26 start-page: i140 year: 2010 ident: 10.1016/j.jcss.2016.03.006_br0290 article-title: Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees publication-title: Bioinformatics doi: 10.1093/bioinformatics/btq198 – year: 1999 ident: 10.1016/j.jcss.2016.03.006_br0090 – volume: 81 start-page: 382 issue: 2 year: 2005 ident: 10.1016/j.jcss.2016.03.006_br0240 article-title: Perfect phylogenetic networks: a new methodology for reconstructing the evolutionary history of natural languages publication-title: Language doi: 10.1353/lan.2005.0078 – volume: 155 start-page: 914 issue: 8 year: 2007 ident: 10.1016/j.jcss.2016.03.006_br0050 article-title: Computing the minimum number of hybridization events for a consistent evolutionary history publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2006.08.008 – volume: 6 start-page: 30 issue: 1 year: 2009 ident: 10.1016/j.jcss.2016.03.006_br0200 article-title: Hybridization in non-binary trees publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2008.86 – volume: 19 start-page: 205 issue: 1 year: 2015 ident: 10.1016/j.jcss.2016.03.006_br0220 article-title: Counting phylogenetic networks publication-title: Ann. Comb. doi: 10.1007/s00026-015-0260-2
SSID	ssj0011563
Score	2.27494
Snippet	Given a finite set X, a collection T of rooted phylogenetic trees on X and an integer k, the Hybridization Number problem asks if there exists a phylogenetic... Given a finite set X , a collection TT of rooted phylogenetic trees on X and an integer k, the Hybridization Number problem asks if there exists a phylogenetic...
SourceID	hal proquest crossref elsevier
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	1075
SubjectTerms	Algorithms Bioinformatics Collection Computer Science Computer simulation Displays Fixed-parameter tractability Hybridization number Kernelization Kernels Mathematical analysis Mathematical models Phylogenetic network Phylogenetic tree Trees
Title	Kernelizations for the hybridization number problem on multiple nonbinary trees
URI	https://dx.doi.org/10.1016/j.jcss.2016.03.006 https://www.proquest.com/docview/1825549433 https://hal.science/hal-02154926
Volume	82
WOSCitedRecordID	wos000378465000006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1090-2724 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JbxMxFLZCygEOLAVEyiKDuEWDPLvnGEGrhEahUouUm-VtlIbRpErSUfun-I08x57JpNCqHMjBil4ynsTvm7fYb0Hokwh8nssQ3FQS5V7EY1MDMk28PI00yf2Ihz7fNJtIJxM6nWYnnc6vOhemKtKypFdX2cV_ZTXQgNkmdfYf2N1MCgR4D0yHEdgO470Yf6yXpS7q9MomjHB2bXKzHLlvG4H0XTsZc2LQRBaWi1LYJF1zYL26xXqVrhvE5vDBloPuO23aWOkmNWoE5qUNBBjrxVa6Fz9diFm1TUU7laZbcsWB25vtW5Mpr9u7En7ShF25rTKn19uiF7xeox2t4rHSlmTEC1KbRF2LYxq0YNeWreCoxi097RPbe-gPHWC3I-af53Jl6rH7ia1i-5eC28PBKTv5esTGo8nx7qetKMXhYAzjjBeeMY9MfcUKvO29II0z2kV7g9Hh9FtzbgXecFjXpzd_1qVp2YjCmz_oNlPowczE5N4wDTb2ztkz9MSxGg8swJ6jji730dO6CQh2OmEfPW5VtHyBvu-iDwP6MKAP76APW_Rhhz4MlBp9uEEf3qDvJfpxdHj2Zei5nh2ejKi_9sA7zXLl5yQRgRKCag6LFmswVKMkFDwgoU5lSrNYERXkRAquA8VBccBLUBGFr1AX7qRfIyxyKlSqlaSKRFwmNADbWSnwKJSUMGcP-fXyMekK2pu-KgWrIxfnzCw5M0vOSMhgyXuo31xzYcu53PntuOYKc4-QNTQZYO3O6z4CC5sbmArugCJmaFsM9dCHmsMMRLo5p-OlXlyuGLj8YORnURge3GeiN-jR9gl8i7rr5aV-hx7Kan2-Wr53CP0N5RLE1Q
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=Kernelizations+for+the+hybridization+number+problem+on+multiple+nonbinary+trees&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=van+Iersel%2C+Leo&rft.au=Kelk%2C+Steven&rft.au=Scornavacca%2C+Celine&rft.date=2016-09-01&rft.pub=Elsevier&rft.issn=0022-0000&rft.eissn=1090-2724&rft.volume=82&rft.issue=6&rft.spage=1075&rft.epage=1089&rft_id=info:doi/10.1016%2Fj.jcss.2016.03.006&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-02154926v1
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon