On Sun, Sep 12, 2010 at 4:26 AM, Stefan Behnel wrote:
> _wolf, 11.09.2010 20:15:
>>
>> does anyone have a suggestion for a ready-to-go, fast kdtree
>> implementation for python 3.1 and up, for nearest-neighbor searches? i
>> used to use the one from numpy/scipy, but find it a pain to install
>> fo
> Do you know about the kdtree implementation in biopython? I don't know
> if it is already available for Python 3, but for me it worked fine in
> Python 2.X.
i heard they use a brute-force approach and it's slow. that's just
rumors alright. also, judging from the classes list on
http://www.biopyt
> Since you're looking for an implementation, I guess you won't be the one
> volunteering to maintain such code in the stdlib, would you?
this is indeed a problem. i am probably not the right one for this
kind of task.
however, i do sometimes feel like the standard library carries too
much cruft
On 11 sep, 20:15, _wolf wrote:
> does anyone have a suggestion for a ready-to-go, fast kdtree
> implementation for python 3.1 and up, for nearest-neighbor searches? i
> used to use the one from numpy/scipy, but find it a pain to install
> for python 3. also, i'm trying to wrap the code
> fromhttp
_wolf, 11.09.2010 20:15:
does anyone have a suggestion for a ready-to-go, fast kdtree
implementation for python 3.1 and up, for nearest-neighbor searches? i
used to use the one from numpy/scipy, but find it a pain to install
for python 3.
The latest release is supposed to work with Py3.
also
does anyone have a suggestion for a ready-to-go, fast kdtree
implementation for python 3.1 and up, for nearest-neighbor searches? i
used to use the one from numpy/scipy, but find it a pain to install
for python 3. also, i'm trying to wrap the code from
http://code.google.com/p/kdtree/
using cython
