Sökning: WFRF:(Beldiceanu Nicolas) >
Combining Tree Part...
Combining Tree Partitioning, Precedence, Incomparability, and Degree Constraints, with an Application to Phylogenetic and Ordered-Path Problems
-
Beldiceanu, Nicolas (författare)
-
Flener, Pierre (författare)
-
Lorca, Xavier (författare)
- Department of Information Technology, Uppsala University, 2006
- Engelska.
-
Serie: Technical report / Department of Information Technology, Uppsala University, 1404-3203 ; 2006-020
- Relaterad länk:
-
https://uu.diva-port... (primary) (Raw object)
-
visa fler...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- The \emphtree and \emphpath constraints, for digraph partitioning by vertex disjoint trees and paths respectively, are unified within a single global constraint, including a uniform treatment of a variety of useful side constraints, such as precedence, incomparability, and degree constraints. The approach provides a sharp improvement over an existing \emphpath constraint, but can also efficiently handle tree problems, such as the phylogenetic supertree construction problem. The key point of the filtering is to take partially into account the strong interactions between the tree partitioning problem and all the side constraints.
Publikations- och innehållstyp
- vet (ämneskategori)
- rap (ämneskategori)