PATRICIA
PATRICIA — practical algorithm to retrieve information coded in alphanumeric. PATRICIA is an algorithm which provides a flexible means of storing, indexing, and retrieving information in a large file, which is economical of index space and of reindexing time. It does not require rearrangement of text or index as new material is added. It requires a minimum restriction of format of text and of keys; it is extremely flexible in the variety of keys it will respond to. It retrieves information in response to keys furnished by the user with a quantity of computation which has a bound which depends linearly on the length of keys and the number of their proper occurrences and is otherwise independent of the size of the library. It has been implemented in several variations as FORTRAN programs for the CDC-3600, utilizing disk file storage of text. It has been applied to several large information-retrieval problems and will be applied to others.
Keywords for this software
References in zbMATH (referenced in 48 articles )
Showing results 1 to 20 of 48.
Sorted by year (- Nishimoto, Takaaki; Takabatake, Yoshimasa; Tabei, Yasuo: A compressed dynamic self-index for highly repetitive text collections (2020)
- Navarro, Gonzalo: Document listing on repetitive collections with guaranteed performance (2019)
- Shafiei, Niloufar: Non-blocking Patricia tries with replace operations (2019)
- Bille, Philip; Ettienne, Mikko Berggren; Gørtz, Inge Li; Vildhøj, Hjalte Wedel: Time-space trade-offs for Lempel-Ziv compressed indexing (2018)
- Belazzougui, Djamal; Cunial, Fabio; Gagie, Travis; Prezza, Nicola; Raffinot, Mathieu: Flexible indexing of repetitive collections (2017)
- Ben Nsira, Nadia; Lecroq, Thierry; Elloumi, Mourad: Algorithms for indexing highly similar DNA sequences (2017)
- Weese, David; Siragusa, Enrico: Full-text indexes for high-throughput sequencing (2017)
- Crochemore, Maxime; Epifanio, Chiara; Grossi, Roberto; Mignosi, Filippo: Linear-size suffix tries (2016)
- Klein, Shmuel T.; Shapira, Dana: Random access to Fibonacci encoded files (2016)
- Orlandi, Alessio; Venturini, Rossano: Space-efficient substring occurrence estimation (2016)
- Takagi, Takuya; Inenaga, Shunsuke; Sadakane, Kunihiko; Arimura, Hiroki: Packed compact tries: a fast and efficient data structure for online string processing (2016)
- Tong, Weitian; Goebel, Randy; Lin, Guohui: Smoothed heights of tries and patricia tries (2016)
- Axelson-Fisk, Marina: Comparative gene finding. Models, algorithms and implementation (2015)
- Jansson, Jesper; Sadakane, Kunihiko; Sung, Wing-Kin: Linked dynamic tries with applications to LZ-compression in sublinear time and space (2015)
- Kisielewicz, Andrzej; Kowalski, Jakub; Szykuła, Marek: Computing the shortest reset words of synchronizing automata (2015)
- Molinero, Xavier; Riquelme, Fabián; Serna, Maria: Forms of representation for simple games: sizes, conversions and equivalences (2015)
- Fuchs, Michael; Hwang, Hsien-Kuei; Zacharovas, Vytas: An analytic approach to the asymptotic variance of trie statistics and related structures (2014)
- Fuchs, Michael; Lee, Chung-Kuei: A general central limit theorem for shape parameters of (m)-ary tries and PATRICIA tries (2014)
- Gagie, Travis; Kärkkäinen, Juha; Navarro, Gonzalo; Puglisi, Simon J.: Colored range queries and document retrieval (2013)
- Hershcovitch, Moshe; Kaplan, Haim: I/O efficient dynamic data structures for longest prefix queries (2013)