{"id":"https://openalex.org/W2039104371","doi":"https://doi.org/10.1137/s0097539701389154","title":"Computing Phylogenetic Roots with Bounded Degrees and Errors","display_name":"Computing Phylogenetic Roots with Bounded Degrees and Errors","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2039104371","doi":"https://doi.org/10.1137/s0097539701389154","mag":"2039104371"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701389154","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701389154","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhi-Zhong Chen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101911266","display_name":"Tao Jiang","orcid":"https://orcid.org/0000-0003-3833-4498"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao Jiang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089344475","display_name":"Guohui Lin","orcid":"https://orcid.org/0000-0003-4283-3396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guohui Lin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101483230"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5782,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.89241257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"32","issue":"4","first_page":"864","last_page":"879"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9835000038146973,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.8331960439682007},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6877158284187317},{"id":"https://openalex.org/keywords/phylogenetics","display_name":"Phylogenetics","score":0.589344322681427},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5845961570739746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5661583542823792},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5187925696372986},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5179742574691772},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4959324300289154},{"id":"https://openalex.org/keywords/phylogenetic-network","display_name":"Phylogenetic network","score":0.4876197874546051},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4461266100406647},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.2377157211303711},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1937027871608734},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12111508846282959},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.07322269678115845}],"concepts":[{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.8331960439682007},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6877158284187317},{"id":"https://openalex.org/C90132467","wikidata":"https://www.wikidata.org/wiki/Q171184","display_name":"Phylogenetics","level":3,"score":0.589344322681427},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5845961570739746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5661583542823792},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5187925696372986},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5179742574691772},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4959324300289154},{"id":"https://openalex.org/C26619641","wikidata":"https://www.wikidata.org/wiki/Q3142246","display_name":"Phylogenetic network","level":4,"score":0.4876197874546051},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4461266100406647},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.2377157211303711},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1937027871608734},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12111508846282959},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.07322269678115845},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539701389154","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701389154","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1579049696","https://openalex.org/W1979545228","https://openalex.org/W2055764977","https://openalex.org/W2068718955","https://openalex.org/W2912101389","https://openalex.org/W4213368513"],"related_works":["https://openalex.org/W4254268221","https://openalex.org/W2951650999","https://openalex.org/W2038264393","https://openalex.org/W147282674","https://openalex.org/W2112400707","https://openalex.org/W4300585845","https://openalex.org/W2101991559","https://openalex.org/W2065083790","https://openalex.org/W2604174992","https://openalex.org/W2057191541"],"abstract_inverted_index":{"Given":[0],"a":[1,19,49,59,86,160,168,194,210,216,225,257],"set":[2],"of":[3,70,84,110,116,172,178,201,260,274],"species":[4,27,60,69],"and":[5,34,61,118,125,144,158,229,249,282],"their":[6],"similarity":[7,44,243],"data,":[8],"an":[9,271],"important":[10],"problem":[11,76,83,156],"in":[12,30,146,239],"evolutionary":[13,23],"biology":[14],"is":[15,150,166,180,205,215,266],"how":[16],"to":[17,255,269],"reconstruct":[18],"phylogeny":[20,32,74,265],"(also":[21],"called":[22,151,167],"tree)":[24],"so":[25],"that":[26,42,96,197,219,280],"are":[28,46,64,112,245,286],"close":[29],"the":[31,43,82,91,105,114,140,152,198,202,235,241,263,275],"if":[33,36,66,124,127,163,221,230],"only":[35,126,268],"they":[37,67],"have":[38],"high":[39,71],"similarity.":[40,72],"Assume":[41],"data":[45,244],"represented":[47],"as":[48,81],"graph":[50,93,173],"G":[51,94,222],"=":[52],"(V,":[53],"E),":[54],"where":[55,137,262],"each":[56],"vertex":[57],"represents":[58],"two":[62],"vertices":[63],"adjacent":[65],"represent":[68],"The":[73,175],"reconstruction":[75],"can":[77],"then":[78],"be":[79,270],"abstracted":[80],"finding":[85],"(phylogenetic)":[87],"tree":[88,147,161],"T":[89,98,111],"from":[90,207],"given":[92],"such":[95,159,224],"(1)":[97],"has":[99,223],"no":[100],"degree-2":[101],"internal":[102],"nodes,":[103],"(2)":[104],"external":[106],"nodes":[107],"(i.e.,":[108],"leaves)":[109],"exactly":[113],"elements":[115],"V,":[117],"(3)":[119],"$(u,":[120],"v)":[121,129],"\\in":[122],"E$":[123],"$d_T(u,":[128],"\\le":[130,185],"k$":[131],"for":[132,183],"some":[133],"fixed":[134],"threshold":[135],"k,":[136],"dT(u,v)":[138],"denotes":[139],"distance":[141],"between":[142],"u":[143],"v":[145],"T.":[148],"This":[149],"phylogenetic":[153,169,203,226],"kth":[154,170,227],"root":[155,171,204,273],"(PRk),":[157],"T,":[162],"it":[164],"exists,":[165],"G.":[174],"computational":[176],"complexity":[177],"PRk}":[179],"open,":[181],"except":[182],"$k":[184],"4$.":[186],"In":[187],"this":[188,281],"paper,":[189],"we":[190,253],"investigate":[191],"PRk":[192,261],"under":[193],"natural":[195],"restriction":[196],"maximum":[199],"degree":[200],"bounded":[206],"above":[208],"by":[209],"constant.":[211],"Our":[212],"main":[213],"contribution":[214],"linear-time":[217],"algorithm":[218],"determines":[220],"root,":[228],"so,":[231],"demonstrates":[232],"one.":[233],"On":[234],"other":[236,283],"hand,":[237],"because":[238],"practice":[240],"collected":[242],"usually":[246],"not":[247],"perfect":[248],"may":[250],"contain":[251],"errors,":[252],"propose":[254],"study":[256],"generalized":[258],"version":[259],"output":[264],"required":[267],"approximate":[272],"input":[276],"graph.":[277],"We":[278],"show":[279],"related":[284],"problems":[285],"computationally":[287],"intractable.":[288]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":32},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}