The biclique k-clustering problem in bipartite graphs and its application in bioinformatics

V. Acuña; C. E. Ferreira; A. S. Freire; E. Moreno

doi:10.1016/j.endm.2010.05.021

The biclique k-clustering problem in bipartite graphs and its application in bioinformatics

V. Acuña, C. E. Ferreira, A. S. Freire, E. Moreno

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

1 Cita (Scopus)

Resumen

In this paper we study the biclique k-clustering problem (B. kCP) in bipartite graphs, a generalization of the maximum edge biclique problem which has several applications in biological data analysis. We present an application of the B. kCP in bioinformatics, and introduce two integer linear formulations for the problem. Finally, we discuss the approximability of the problem and show computational experiments with random generated instances and also with instances that come the application.

Idioma original	Inglés
Páginas (desde-hasta)	159-166
Número de páginas	8
Publicación	Electronic Notes in Discrete Mathematics
Volumen	36
N.º	C
DOI	https://doi.org/10.1016/j.endm.2010.05.021
Estado	Publicada - ago. 2010
Publicado de forma externa	Sí

Acceder al documento

10.1016/j.endm.2010.05.021

Citar esto

@article{cbe8d0d415af4778ac926075c6d71c54,

title = "The biclique k-clustering problem in bipartite graphs and its application in bioinformatics",

abstract = "In this paper we study the biclique k-clustering problem (B. kCP) in bipartite graphs, a generalization of the maximum edge biclique problem which has several applications in biological data analysis. We present an application of the B. kCP in bioinformatics, and introduce two integer linear formulations for the problem. Finally, we discuss the approximability of the problem and show computational experiments with random generated instances and also with instances that come the application.",

keywords = "Biclique clustering, Biclustering, Maximum edge biclique",

author = "V. Acu{\~n}a and Ferreira, {C. E.} and Freire, {A. S.} and E. Moreno",

year = "2010",

month = aug,

doi = "10.1016/j.endm.2010.05.021",

language = "English",

volume = "36",

pages = "159--166",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - The biclique k-clustering problem in bipartite graphs and its application in bioinformatics

AU - Acuña, V.

AU - Ferreira, C. E.

AU - Freire, A. S.

AU - Moreno, E.

PY - 2010/8

Y1 - 2010/8

N2 - In this paper we study the biclique k-clustering problem (B. kCP) in bipartite graphs, a generalization of the maximum edge biclique problem which has several applications in biological data analysis. We present an application of the B. kCP in bioinformatics, and introduce two integer linear formulations for the problem. Finally, we discuss the approximability of the problem and show computational experiments with random generated instances and also with instances that come the application.

AB - In this paper we study the biclique k-clustering problem (B. kCP) in bipartite graphs, a generalization of the maximum edge biclique problem which has several applications in biological data analysis. We present an application of the B. kCP in bioinformatics, and introduce two integer linear formulations for the problem. Finally, we discuss the approximability of the problem and show computational experiments with random generated instances and also with instances that come the application.

KW - Biclique clustering

KW - Biclustering

KW - Maximum edge biclique

UR - http://www.scopus.com/inward/record.url?scp=77954912182&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2010.05.021

DO - 10.1016/j.endm.2010.05.021

M3 - Article

AN - SCOPUS:77954912182

SN - 1571-0653

VL - 36

SP - 159

EP - 166

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

IS - C

ER -

The biclique k-clustering problem in bipartite graphs and its application in bioinformatics

Resumen

Acceder al documento

Huella

Citar esto