Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Satish Ch. Panigrahi"'
Publikováno v:
Journal of Discrete Algorithms. 21:18-31
In this paper we investigate the following type of proximity problems: given a set of n points in the plane P={p"1,p"2,p"3,...,p"n}, for each point p"i find a pair {p"j,p"k}, where i j k, such that a measure M defined on the triplet of points {p"i,p"
Autor:
Vida Abedi, Ruben Acuña, Mohammad Ayache, Mahmood Bahar, Azita A. Bahrami, Josep Bassaganya-Riera, Christian Baumgartner, Paul Bejjani, Christian Berger-Vachon, Jonathan Berkhahn, Michael Berry, H.B. Çakmak, E. Çalık, A. Çavuşoğlu, Adria Carbo, Steven M. Carr, Gloria Castellano, QinQun Chen, Xiumin Chen, Jacques Chomilier, Donald Craig, Andreas Dander, H. Dawn Marshall, Leonidas Deligiannidis, J. Demongeot, Luis R. Domingo, Andrei Doncescu, Zhong-Hui Duan, Abbass Zein Eddine, Behrouz H. Far, Joaquim Cezar Felipe, C. Ferrer, Burtram Fielding, Junaid Gamieldien, Dan Gnansia, Thomas Goulding, D. Graveron-Demilly, François Guerin, Michael Handler, Mohammad Shabbir Hasan, Ray R. Hashemi, H. Hazgui, Wei He, A. Henrion Caude, Raquel Hontecillas, Stefan Hoops, Arnaud Jeanvoine, V. Kantabutra, Lina J. Karam, D.A. Karras, H. Kaya, Bo Kim, Zoé Lacroix, Dimitri Lefebvre, Andy Lin, Jian-Qin Liu, Pinyi Lu, Yongguo Mei, B.G. Mertzios, Kato Mivule, Emad A. Mohammed, Vicente Molieri, Asish Mukhopadhyay, Christopher Naugler, Michael Netzer, Haruhiko Nishimura, Sou Nobukawa, J. Oliver, Zhihui Pang, Satish Ch. Panigrahi, G.A. Papakostas, Nikolaos Papandreou, Vitor Manuel Dinis Pereira, Bernhard Pfeifer, Casandra Philipson, R. Ponalagusamy, Jacob Porter, Junfeng Qu, Ponnadurai Ramasami, Lydia Rhyman, Branko Ristic, Ali Saad, Mariana Yuri Sasazaki, Jose A. Sáez, B. Şen, Md. Shafiul Alam, Maad Shatnawi, Pierre Siegel, B.G. Sileshi, Alex Skvortsov, Desmond J. Smith, Yinglei Song, Liao Shaoyi Stephen, Daniel Swain, Peter Sylvester, Francisco Torrens, Eric Truy, Nicholas R. Tyler, D. van Ormondt, Todd Wareham, Yujing Xu, Teruya Yamanishi, Iyad Zaarour, Liqing Zhang, Guangquan Zhou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63ee42d2b481c871259b9f4382e5e9aa
https://doi.org/10.1016/b978-0-12-802508-6.09987-7
https://doi.org/10.1016/b978-0-12-802508-6.09987-7
Publikováno v:
Bioinformatics Research and Applications ISBN: 9783319190471
ISBRA
ISBRA
Multiple Structure Alignment (MStA) is a fundamental problem in Computational Biology and proteomics in particular. Therefore, a number of algorithms have been proposed, chief among which are MUSTANG, POSA, MultiProt, CE-MC. In this paper we propose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::925248d72e264e0534ac348708efb797
https://doi.org/10.1007/978-3-319-19048-8_24
https://doi.org/10.1007/978-3-319-19048-8_24
The availability of large volumes of gene expression data from microarray analysis [complementary DNA (cDNA) and oligonucleotide] has opened the door to the diagnoses and treatments of various diseases based on gene expression profiling. This chapter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e57302614ecee00e57b4adaef4e4877
https://doi.org/10.1016/b978-0-12-802508-6.00012-0
https://doi.org/10.1016/b978-0-12-802508-6.00012-0
Publikováno v:
Bioinformatics Research and Applications ISBN: 9783319081700
ISBRA
ISBRA
The alignment of two protein structures is a fundamental problem in structural bioinformatics. Their structural similarity carries with it the connotation of similar functional behavior that could be exploited in various applications. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e208d17f6f8e8267a736051329b5462b
https://doi.org/10.1007/978-3-319-08171-7_3
https://doi.org/10.1007/978-3-319-08171-7_3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642396397
ICCSA (5)
ICCSA (5)
The availability of large volumes of gene expression data from microarray analysis (cDNA and oligonucleotide) has opened a new door to the diagnoses and treatments of various diseases based on gene expression profiling. In this paper, we discuss a ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73eb0142bb883719b3efcd0e32b1793f
https://doi.org/10.1007/978-3-642-39640-3_4
https://doi.org/10.1007/978-3-642-39640-3_4
Publikováno v:
2006 International Conference on Advanced Computing and Communications.
The paper introduces a new interconnection system OMTSE (Optical Multi-Trees with shuffle Exchange) using both electronics and optical links among processors. The network has a total of N = 3n3/2 nodes. The diameter of the network is 0(log n) and the