| Document Date: 2014-01-08 11:56:00
Open Document File Size: 499,98 KBShare Result on Facebook
City Charlotte / / Company Make S a / MCL / IPL / 201X 1 Partitioning Biological Networks / Intel / / Country Germany / United States / / / IndustryTerm data reduction cut algorithm / protein interaction networks / min-cut algorithm / tion branching algorithms / least algorithms / local search / much networks / biological systems / progress towards exact algorithms / fixedparameter algorithm / dynamic programming algorithm / denser network / dense network / data reduction algorithm / parameter algorithm / fixed-parameter algorithm / feasible solution / biological networks / computational tool / valid solution / thaliana network / overall solution / search tree / lar clustering algorithm / large biological networks / heuristic solutions / / MusicAlbum Rules / / OperatingSystem Debian GNU/Linux / L3 / / Organization Institut für Informatik / Institut für Softwaretechnik / / Person Rolf Niedermeier / Recall / Neighbor / Min-Cut Min-Cut / Min-Cut Min / Adrian Liebtrau / Column Generaconjecture / Christian Komusiewicz / / Position model / / ProgrammingLanguage C / K / V / T / C++ / / PublishedMedium Lecture Notes in Computer Science / / Technology fixedparameter algorithm / min-cut algorithm / BIOINFORMATICS / Linux / 3.2 Fixed-Parameter Algorithm / CLICK algorithm / clustering algorithm / making data reduction cut algorithm / ing Algorithm / two algorithms / fixed-parameter algorithm / lar clustering algorithm / SIDES algorithm / data reduction algorithm / tion branching algorithms / dynamic programming algorithm / parameter algorithm / Digital Object Identifier / Fixedparameter algorithms / / URL http /
SocialTag |
IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. XX, NO. X, JANUARY 201X 1 Partitioning Biological Networks into Highly Connected Clusters