Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Falk Hüffner"'
Publikováno v:
Algorithms, Vol 8, Iss 1, Pp 60-81 (2015)
The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices. We examine the parameterized complexity of RAINBOW SUBGRAPH
Externí odkaz:
https://doaj.org/article/5e9fbe7d97ba43679b24df758bcad255
Publikováno v:
Transportation Research Record: Journal of the Transportation Research Board. 2675:44-53
Strategic Routing is a traffic intervention mechanism. To reduce traffic in a certain area, drivers are asked to take a pre-defined route diverting them from the area, even though this increases their travel time. This can be implemented with navigat
Publikováno v:
Theoretical Computer Science. 717:26-36
Given a task that requires some skills and a social network of individuals with different skills, the Team Formation problem asks to find a team of individuals that together can perform the task, while minimizing communication costs. Since the proble
Publikováno v:
Computational Biology and Chemistry
Computational Biology and Chemistry, Elsevier, 2018, 74, pp.379-390. ⟨10.1016/j.compbiolchem.2018.03.015⟩
Computational Biology and Chemistry, Elsevier, 2018, 74, pp.379-390. ⟨10.1016/j.compbiolchem.2018.03.015⟩
In this paper, we introduce and analyze two graph-based models for assigning orthologs in the presence of whole-genome duplications, using similarity information between pairs of genes. The common feature of our two models is that genes of the first
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96f5019342879486b2a948d07dbe8379
https://hal.archives-ouvertes.fr/hal-01911090
https://hal.archives-ouvertes.fr/hal-01911090
Publikováno v:
Algorithms, Vol 8, Iss 1, Pp 60-81 (2015)
Graph-Theoretic Concepts in Computer Science ISBN: 9783319123394
WG
Algorithms
Volume 8
Issue 1
Pages 60-81
Graph-Theoretic Concepts in Computer Science ISBN: 9783319123394
WG
Algorithms
Volume 8
Issue 1
Pages 60-81
The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices. We examine the parameterized complexity of RAINBOW SUBGRAPH
Publikováno v:
IEEE/ACM Transactions on Computational Biology and Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2014, 11 (3), pp.455-467. ⟨10.1109/TCBB.2013.177⟩
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2014, 11 (3), pp.455-467. ⟨10.1109/TCBB.2013.177⟩
A popular clustering algorithm for biological networks which was proposed by Hartuv and Shamir identifies nonoverlapping highly connected components. We extend the approach taken by this algorithm by introducing the combinatorial optimization problem
Publikováno v:
Methods in molecular biology (Clifton, N.J.). 1526
Fixed-parameter algorithms are designed to efficiently find optimal solutions to some computationally hard (NP-hard) problems by identifying and exploiting "small" problem-specific parameters. We survey practical techniques to develop such algorithms
Publikováno v:
Computability. 2:31-49
Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A kernelization reduces in polynomial time an input instance to an equivalent instance whose size is bounded by a function only depending
Publikováno v:
Algorithmic Aspects in Information and Management ISBN: 9783319411675
AAIM
AAIM
Given a task that requires some skills and a social network of individuals with different skills, the Team Formation problem asks to find a team of individuals that together can perform the task, while minimizing communication costs. Since the proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7d63eb49412f2c8cad6bbc2c7ecf8f5
https://doi.org/10.1007/978-3-319-41168-2_12
https://doi.org/10.1007/978-3-319-41168-2_12