Reconstructing perfect phylogenies via branchings in acyclic digraphs : a new lower bound and efficiently solvable cases

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Reconstructing perfect phylogenies via branchings in acyclic digraphs : a new lower bound and efficiently solvable cases
Authors:	ID Baghirova, Narmina (Author) ID Milanič, Martin (Mentor) More about this mentor...
Files:	https://www.famnit.upr.si/sl/studij/zakljucna_dela/view/916
Language:	English
Work type:	Master's thesis/paper
Typology:	2.09 - Master's Thesis
Organization:	FAMNIT - Faculty of Mathematics, Science and Information Technologies
Keywords:	perfect phylogeny, minimum conflict-free row split problem, minimum uncovering branching problem, branching, acyclic digraph, chain partition, Dilworth's theorem
Place of publishing:	Koper
Place of performance:	Koper
Publisher:	[N. Baghirova]
Year of publishing:	2020
Year of performance:	2020
Number of pages:	X, 64 str.
PID:	20.500.12556/RUP-13944
UDC:	519.17(043.2)
COBISS.SI-ID:	24424963
Publication date in RUP:	07.08.2020
Views:	2566
Downloads:	79
Metadata:
:	BAGHIROVA, Narmina, 2020, Reconstructing perfect phylogenies via branchings in acyclic digraphs : a new lower bound and efficiently solvable cases [online]. Master’s thesis. Koper : N. Baghirova. [Accessed 5 April 2025]. Retrieved from: https://www.famnit.upr.si/sl/studij/zakljucna_dela/view/916 Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Similar works from other repositories:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Language:	English
Title:	Rekonstrukcija popolnih filogenij prek vejitev v acikličnih digrafih primeri : nova spodnja meja in učinkovito rešljivi
Keywords:	popolna filogenija, problem najmanjšega brezkonfliktnega razcepa vrstic, problem vejitve najmanjšega nepokritja, vejitev, acikličen digraf, particija delno urejene množice na verige, Dilworthov izrek

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back