Sciweavers

2621 search results - page 36 / 525
» Near orders and codes
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 9 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
BMCBI
2010
100views more  BMCBI 2010»
13 years 8 months ago
Scaffold filling, contig fusion and comparative gene order inference
Background: There has been a trend in increasing the phylogenetic scope of genome sequencing without finishing the sequence of the genome. Increasing numbers of genomes are being ...
Adriana Muñoz, Chunfang Zheng, Qian Zhu, Vi...
BMCBI
2008
125views more  BMCBI 2008»
13 years 8 months ago
SynteBase/SynteView: a tool to visualize gene order conservation in prokaryotic genomes
Background: It has been repeatedly observed that gene order is rapidly lost in prokaryotic genomes. However, persistent synteny blocks are found when comparing more or less distan...
Frédéric Lemoine, Bernard Labedan, O...
FOCS
2008
IEEE
14 years 3 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
NN
2007
Springer
14 years 2 months ago
Impact of Higher-Order Correlations on Coincidence Distributions of Massively Parallel Data
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
Sonja Grün, Moshe Abeles, Markus Diesmann