959 search results - page 61 / 192 » Comparative genome assembly |
101
Voted
ICECCS
2005
IEEE
15 years 6 months ago
2005
IEEE
Mobile code solutions can improve the performances of applications over the Internet by reducing the amount of data that must be transferred across the network. The research on ge...
84
Voted
BMCBI
2006
15 years 19 days ago
2006
Background: Genome wide and cross species comparisons of amino acid repeats is an intriguing problem in biology mainly due to the highly polymorphic nature and diverse functions o...
114
Voted
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
110
click to vote
PKDD
2001
Springer
15 years 5 months ago
2001
Springer
In some domains, Information Extraction (IE) from texts requires syntactic and semantic parsing. This analysis is computationally expensive and IE is potentially noisy if it applie...
120
Voted
RECOMB
2000
Springer
15 years 4 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...