Format
Sort by
Items per page

Send to

Choose Destination

Search results

Items: 6

1.

Matching algorithms for assigning orthologs after genome duplication events.

Fertin G, Hüffner F, Komusiewicz C, Sorge M.

Comput Biol Chem. 2018 Jun;74:379-390. doi: 10.1016/j.compbiolchem.2018.03.015. Epub 2018 Mar 14.

PMID:
29650458
2.

Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.

Hüffner F, Komusiewicz C, Niedermeier R, Wernicke S.

Methods Mol Biol. 2017;1526:363-402.

PMID:
27896752
3.

A graph modification approach for finding core-periphery structures in protein interaction networks.

Bruckner S, Hüffner F, Komusiewicz C.

Algorithms Mol Biol. 2015 May 2;10:16. doi: 10.1186/s13015-015-0043-7. eCollection 2015.

4.

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.

Hüffner F, Komusiewicz C, Liebtrau A, Niedermeier R.

IEEE/ACM Trans Comput Biol Bioinform. 2014 May-Jun;11(3):455-67. doi: 10.1109/TCBB.2013.177.

PMID:
26356014
5.

An analytical approach to network motif detection in samples of networks with pairwise different vertex labels.

Schmidt C, Weiss T, Komusiewicz C, Witte H, Leistritz L.

Comput Math Methods Med. 2012;2012:910380. doi: 10.1155/2012/910380. Epub 2012 May 14.

6.

Parameterized algorithmics for finding connected motifs in biological networks.

Betzler N, van Bevern R, Fellows MR, Komusiewicz C, Niedermeier R.

IEEE/ACM Trans Comput Biol Bioinform. 2011 Sep-Oct;8(5):1296-308. doi: 10.1109/TCBB.2011.19.

PMID:
21282862

Supplemental Content

Loading ...
Support Center