Sciweavers

141 search results - page 10 / 29
» Genome Rearrangement in Mitochondria and Its Computational B...
Sort
View
ENGL
2007
180views more  ENGL 2007»
14 years 9 months ago
Biological Data Mining for Genomic Clustering Using Unsupervised Neural Learning
— The paper aims at designing a scheme for automatic identification of a species from its genome sequence. A set of 64 three-tuple keywords is first generated using the four type...
Shreyas Sen, Seetharam Narasimhan, Amit Konar
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
14 years 9 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
ISMB
1998
14 years 11 months ago
Sequence Assembly Validation by Multiple Restriction Digest Fragment Coverage Analysis
DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. This report examines the possibility of analyzing multiple,...
Eric C. Rouchka, David J. States
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 1 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
SP
2008
IEEE
100views Security Privacy» more  SP 2008»
15 years 4 months ago
Towards Practical Privacy for Genomic Computation
Many basic tasks in computational biology involve operations on individual DNA and protein sequences. These sequences, even when anonymized, are vulnerable to re-identification a...
Somesh Jha, Louis Kruger, Vitaly Shmatikov