✦ LIBER ✦

An optimized data structure for high-throughput 3D proteomics data: mzRTree

✍ Scribed by Sara Nasso; Francesco Silvestri; Francesco Tisiot; Barbara Di Camillo; Andrea Pietracaprina; Gianna Maria Toffolo

Book ID: 111713333
Publisher: Elsevier
Year: 2010
Tongue: English
Weight: 417 KB
Volume: 73
Category: Article
ISSN: 1874-3919
DOI: 10.1016/j.jprot.2010.02.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interpretation of mass spectrometry data

Interpretation of mass spectrometry data for high-throughput proteomics

✍ Daniel C. Chamrad; Gerhard Koerting; Johan Gobom; Herbert Thiele; Joachim Klose; 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 581 KB

SR-tree: An index structure for nearest-

SR-tree: An index structure for nearest-neighbor searching of high-dimensional point data

✍ Norio Katayama; Shin'ichi Satoh 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 2 views

Similarity search methods using feature vectors are employed widely for implementation of content-based retrieval of visual data, and appropriate index structures were explored to accelerate the search. Methods proposed hitherto have used the R \* -tree and the SS-tree. This study offers a faster in

Dynamic Tubular Grid: An Efficient Data

Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets

✍ Michael B. Nielsen; Ken Museth 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 552 KB