Search: onr:"swepub:oai:DiVA.org:su-192158" >
Corrigendum to “Bes...
Corrigendum to “Best match graphs”
-
Schaller, David (author)
-
Geiß, Manuela (author)
-
Chávez, Edgar (author)
-
show more...
-
González Laffitte, Marcos (author)
-
López Sánchez, Alitzel (author)
-
Stadler, Bärbel M. R. (author)
-
Valdivia, Dulce I. (author)
-
- Hellmuth, Marc (author)
- Stockholms universitet,Matematiska institutionen
-
Hernández Rosales, Maribel (author)
-
Stadler, Peter F. (author)
-
show less...
-
(creator_code:org_t)
- 2021-04-05
- 2021
- English.
-
In: Journal of Mathematical Biology. - : Springer Science and Business Media LLC. - 0303-6812 .- 1432-1416. ; 82:6
- Related links:
-
https://doi.org/10.1...
-
show more...
-
https://su.diva-port... (primary) (Raw object)
-
https://link.springe...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- Two errors in the article Best Match Graphs (Geiß et al. in JMB 78: 2015–2057, 2019) are corrected. One concerns the tacit assumption that digraphs are sink-free, which has to be added as an additional precondition in Lemma 9, Lemma 11, Theorem 4. Correspondingly, Algorithm 2 requires that its input is sink-free. The second correction concerns an additional necessary condition in Theorem 9 required to characterize best match graphs. The amended results simplify the construction of least resolved trees for n-cBMGs, i.e., Algorithm 1. All other results remain unchanged and are correct as stated.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Bioinformatik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Bioinformatics (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Matematik -- Diskret matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Discrete Mathematics (hsv//eng)
Publication and Content Type
- vet (subject category)
- art (subject category)
Find in a library
To the university's database