Exact and Heuristic Algorithms for Network Alignment using Graph Edit Distance 
Models

Ibragimov, Rashid

doi:10.22028/D291-26594

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Thesis

Exact and Heuristic Algorithms for Network Alignment using Graph Edit Distance Models

MPS-Authors

/persons/resource/persons44666

Ibragimov, Rashid
Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society;
International Max Planck Research School, MPI for Informatics, Max Planck Society;

External Resource

http://scidok.sulb.uni-saarland.de/volltexte/2015/5999/
(Any fulltext)

http://scidok.sulb.uni-saarland.de/doku/urheberrecht.php?la=de
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Ibragimov, R. (2015). Exact and Heuristic Algorithms for Network Alignment using Graph Edit Distance Models. PhD Thesis, Universität des Saarlandes, Saarbrücken. doi:10.22028/D291-26594.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0029-6E4C-7

Abstract

There is no abstract available