2014 IEEE International Conference on Bioinformatics and Bioengineering 2014
DOI: 10.1109/bibe.2014.43
|View full text |Cite
|
Sign up to set email alerts
|

Optimization and Analysis of Seriation Algorithm for Ordering Protein Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…Such clustering methods are mathematically arbitrary, thus have little a priori biological basis. This study uses matrix seriation ( 18 ), a method that reorders a matrix of gene–gene interaction into a cyclical arrangement, if one exists, instead of a clustered arrangement made by the currently popular clustering algorithms. The seriation method is inspired by the famous ‘Traveling Salesman Problem’ ( 19 ) to calculate an optimal cycle among the genetic interaction data, with the assumption that the optimal arrangement likely coincides with an optimum temporal biological process cycle.…”
Section: Introductionmentioning
confidence: 99%
“…Such clustering methods are mathematically arbitrary, thus have little a priori biological basis. This study uses matrix seriation ( 18 ), a method that reorders a matrix of gene–gene interaction into a cyclical arrangement, if one exists, instead of a clustered arrangement made by the currently popular clustering algorithms. The seriation method is inspired by the famous ‘Traveling Salesman Problem’ ( 19 ) to calculate an optimal cycle among the genetic interaction data, with the assumption that the optimal arrangement likely coincides with an optimum temporal biological process cycle.…”
Section: Introductionmentioning
confidence: 99%