Sciweavers

2877 search results - page 247 / 576
» Computational Biology
Sort
View
RECOMB
2005
Springer
16 years 7 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
RECOMB
2004
Springer
16 years 7 months ago
Discovering temporal relations in molecular pathways using protein-protein interactions
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mi...
Martin Farach-Colton, Yang Huang, John L. L. Woolf...
RECOMB
1998
Springer
15 years 10 months ago
A polyhedral approach to RNA sequence structure alignment
Ribonucleic acid (RNA) is a polymer composed of four bases denoted A, C, G, and U. It is a generally single-stranded molecule where the bases form hydrogen bonds within the same m...
Hans-Peter Lenhof, Knut Reinert, Martin Vingron
TCSV
2010
15 years 1 months ago
Near Duplicate Identification With Spatially Aligned Pyramid Matching
Abstract--A new framework, termed Spatially Aligned Pyramid Matching (SAPM), is proposed for Near Duplicate Image Identification. The proposed method robustly handles spatial shift...
Dong Xu, Tat-Jen Cham, Shuicheng Yan, Lixin Duan, ...
IJCNN
2006
IEEE
16 years 19 days ago
Optimal In-Place Learning and the Lobe Component Analysis
— It is difficult to map many existing learning algorithms onto biological networks because the former require a separate learning network. The computational basis of biological...
Juyang Weng, Nan Zhang 0002