Sciweavers

JCB
1998
92views more  JCB 1998»
13 years 4 months ago
Homology Detection via Family Pairwise Search
The function of an unknown biological sequence can often be accurately inferred by identifying sequences homologous to the original sequence. Given a query set of known homologs, ...
William Noble Grundy
BMCBI
2005
109views more  BMCBI 2005»
13 years 4 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
BMCBI
2006
95views more  BMCBI 2006»
13 years 4 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
BMCBI
2006
141views more  BMCBI 2006»
13 years 4 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
IJIT
2004
13 years 6 months ago
Parallezation Protein Sequence Similarity Algorithms using Remote Method Interface
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computatio...
Mubarak Saif Mohsen, Zurinahni Zainol, Rosalina Ab...
IDEAS
1997
IEEE
237views Database» more  IDEAS 1997»
13 years 8 months ago
Sequence Comparison Using a Relational Database Approach
A variety of heterogenous data sources is available in the field of molecular biology. Our focus lies on the biological sequence data, i. e. data maintained in collections like EM...
André Bergholz, Stephan Heymann, Jörg ...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 9 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
WPES
2003
ACM
13 years 9 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
FCT
2005
Springer
13 years 10 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...