{"id":"https://openalex.org/W2178116779","doi":"https://doi.org/10.1137/s0097539798342496","title":"Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model","display_name":"Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2178116779","doi":"https://doi.org/10.1137/s0097539798342496","mag":"2178116779"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539798342496","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798342496","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/A5057611636","display_name":"Mary Cryan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mary Cryan","raw_affiliation_strings":["School of Informatics, Laboratory for Foundations of Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Informatics, Laboratory for Foundations of Computer Science","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029293569","display_name":"Leslie Ann Goldberg","orcid":"https://orcid.org/0000-0003-1879-6089"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leslie Ann Goldberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067662147","display_name":"Paul W. Goldberg","orcid":"https://orcid.org/0000-0002-5436-7890"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paul W. Goldberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1869,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.90079539,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"31","issue":"2","first_page":"375","last_page":"397"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"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/T12029","display_name":"DNA and Biological Computing","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/markov-chain","display_name":"Markov chain","score":0.6734104752540588},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6133283376693726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6075267195701599},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.5443210005760193},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.49560391902923584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46478959918022156},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4546355605125427},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45428183674812317},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44302287697792053},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.43759042024612427},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41289329528808594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27078670263290405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2675926089286804},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13186216354370117},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11406064033508301}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6734104752540588},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6133283376693726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6075267195701599},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.5443210005760193},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.49560391902923584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46478959918022156},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4546355605125427},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45428183674812317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44302287697792053},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.43759042024612427},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41289329528808594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27078670263290405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2675926089286804},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13186216354370117},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11406064033508301},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539798342496","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798342496","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W160062981","https://openalex.org/W2019750012","https://openalex.org/W2042959539","https://openalex.org/W2088484367","https://openalex.org/W2099111195","https://openalex.org/W4239617799"],"related_works":["https://openalex.org/W2379651310","https://openalex.org/W1541249122","https://openalex.org/W2084326697","https://openalex.org/W2113019827","https://openalex.org/W2027903142","https://openalex.org/W2354322608","https://openalex.org/W2077211377","https://openalex.org/W2186675474","https://openalex.org/W2387462590","https://openalex.org/W2413828414"],"abstract_inverted_index":{"The":[0],"j-state":[1],"general":[2,30,157],"Markov":[3,31,88,161],"model":[4,13,32,39,94],"of":[5,18,23,33,40,107,114,136,141,150,159],"evolution":[6,17,34,41],"(due":[7],"to":[8,83,121],"Steel)":[9],"is":[10,62],"a":[11,53,57,69,73,110],"stochastic":[12],"concerned":[14],"with":[15],"the":[16,28,36,44,50,63,66,76,92,97,101,116,128,134,142,148,156],"strings":[19],"over":[20],"an":[21,60],"alphabet":[22],"size":[24],"j.":[25],"In":[26],"particular,":[27],"two-state":[29,160],"generalizes":[35],"well-known":[37],"Cavender--Farris--Neyman":[38,93],"by":[42],"removing":[43],"symmetry":[45],"restriction":[46,103],"(which":[47],"requires":[48],"that":[49,52,68,96,104],"probability":[51,67,113],"\"0\"":[54,74],"turns":[55,71],"into":[56,72],"\"1\"":[58,70],"along":[59,75],"edge":[61],"same":[64],"as":[65],"edge).":[77],"Farach":[78],"and":[79,125],"Kannan":[80],"showed":[81],"how":[82,120],"probably":[84],"approximately":[85],"correct":[86],"(PAC)-learn":[87],"evolutionary":[89,162],"trees":[90],"in":[91],"provided":[95],"target":[98],"tree":[99],"satisfies":[100],"additional":[102],"all":[105],"pairs":[106],"leaves":[108],"have":[109],"sufficiently":[111],"high":[112],"being":[115],"same.":[117],"We":[118],"show":[119],"remove":[122],"both":[123],"restrictions":[124],"thereby":[126],"obtain":[127],"first":[129],"polynomial-time":[130],"PAC-learning":[131],"algorithm":[132],"(in":[133],"sense":[135],"Kearns":[137],"et":[138],"al.":[139],"[Proceedings":[140],"26th":[143],"Annual":[144],"ACM":[145],"Symposium":[146],"on":[147],"Theory":[149],"Computing,":[151],"1994,":[152],"pp.":[153],"273--282])":[154],"for":[155],"class":[158],"trees.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}