Page MenuHomeSoftware Heritage
Differential D8338 Diff 30824 swh/lister/hackage/tests/data/https_hackage.haskell.org/packages_search_1

Changeset View

Standalone View

View Options

swh/lister/hackage/tests/data/https_hackage.haskell.org/packages_search_1

  • This file was added.
{"numberOfResults":150,"pageContents":[{"description":"Command-line program for type-checking and compiling Agda programs","downloads":20,"lastUpload":"2012-03-12T11:01:45Z","maintainers":[{"display":"NilsAndersDanielsson","uri":"/user/NilsAndersDanielsson"},{"display":"UlfNorell","uri":"/user/UlfNorell"}],"name":{"display":"Agda-executable","uri":"/package/Agda-executable"},"tags":[{"display":"dependent-types","uri":"/packages/tag/dependent-types"},{"display":"deprecated","uri":"/packages/tag/deprecated"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Aho-Corasick string matching algorithm","downloads":7,"lastUpload":"2012-11-09T05:36:49Z","maintainers":[{"display":"SergeyLymar","uri":"/user/SergeyLymar"}],"name":{"display":"AhoCorasick","uri":"/package/AhoCorasick"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"library","uri":"/packages/tag/library"},{"display":"text","uri":"/packages/tag/text"}],"votes":0},{"description":"Find the minimal subset/submap satisfying some property.","downloads":7,"lastUpload":"2016-08-24T06:15:53.900038Z","maintainers":[{"display":"EchoNolan","uri":"/user/EchoNolan"}],"name":{"display":"AlanDeniseEricLauren","uri":"/package/AlanDeniseEricLauren"},"tags":[{"display":"algorithms","uri":"/packages/tag/algorithms"},{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Algorithmic music composition","downloads":6,"lastUpload":"2018-04-06T11:21:37Z","maintainers":[{"display":"omelkonian","uri":"/user/omelkonian"}],"name":{"display":"AlgoRhythm","uri":"/package/AlgoRhythm"},"tags":[{"display":"algorithmic-music-composition","uri":"/packages/tag/algorithmic-music-composition"},{"display":"automatic-music-generation","uri":"/packages/tag/automatic-music-generation"},{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"chaos-music","uri":"/packages/tag/chaos-music"},{"display":"generative-music-grammars","uri":"/packages/tag/generative-music-grammars"},{"display":"library","uri":"/packages/tag/library"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Example implementation of Algorithm W for Hindley-Milner\ntype inference.","downloads":10,"lastUpload":"2015-05-27T07:33:48.676828Z","maintainers":[{"display":"MartinGrabmueller","uri":"/user/MartinGrabmueller"}],"name":{"display":"AlgorithmW","uri":"/package/AlgorithmW"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"development","uri":"/packages/tag/development"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Collection of alignment algorithms","downloads":11,"lastUpload":"2017-03-14T14:41:48.734043445Z","maintainers":[{"display":"ChristianHoener","uri":"/user/ChristianHoener"}],"name":{"display":"AlignmentAlgorithms","uri":"/package/AlignmentAlgorithms"},"tags":[{"display":"algorithms","uri":"/packages/tag/algorithms"},{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"data-structures","uri":"/packages/tag/data-structures"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"},{"display":"linguistics","uri":"/packages/tag/linguistics"}],"votes":0},{"description":"Near-future Sci-Fi roguelike and tactical squad combat game","downloads":105,"lastUpload":"2021-12-17T17:46:58.38087348Z","maintainers":[{"display":"MikolajKonarski","uri":"/user/MikolajKonarski"}],"name":{"display":"Allure","uri":"/package/Allure"},"tags":[{"display":"agpl","uri":"/packages/tag/agpl"},{"display":"game","uri":"/packages/tag/game"},{"display":"library","uri":"/packages/tag/library"},{"display":"program","uri":"/packages/tag/program"},{"display":"roguelike","uri":"/packages/tag/roguelike"}],"votes":2},{"description":"Android view hierarchy importer","downloads":4,"lastUpload":"2012-12-19T12:15:44Z","maintainers":[{"display":"alpheccar","uri":"/user/alpheccar"}],"name":{"display":"AndroidViewHierarchyImporter","uri":"/package/AndroidViewHierarchyImporter"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"development","uri":"/packages/tag/development"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Updated version of Yampa: a library for programming hybrid systems.","downloads":4,"lastUpload":"2011-03-27T02:54:06Z","maintainers":[{"display":"EdwardAmsden","uri":"/user/EdwardAmsden"}],"name":{"display":"Animas","uri":"/package/Animas"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"frp","uri":"/packages/tag/frp"},{"display":"library","uri":"/packages/tag/library"},{"display":"reactivity","uri":"/packages/tag/reactivity"}],"votes":0},{"description":"Constructing, analyzing and destructing annotated trees","downloads":18,"lastUpload":"2016-12-05T10:03:17.260388Z","maintainers":[{"display":"MartijnVanSteenbergen","uri":"/user/MartijnVanSteenbergen"}],"name":{"display":"Annotations","uri":"/package/Annotations"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"generics","uri":"/packages/tag/generics"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Convert ANSI Terminal Sequences to nice HTML markup","downloads":5,"lastUpload":"2011-09-10T19:20:01Z","maintainers":[{"display":"JensStimpfle","uri":"/user/JensStimpfle"}],"name":{"display":"Ansi2Html","uri":"/package/Ansi2Html"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"program","uri":"/packages/tag/program"},{"display":"web","uri":"/packages/tag/web"}],"votes":0},{"description":"A simple music library with the capability of generating .ly and .mid files.","downloads":10,"lastUpload":"2020-07-07T13:19:57.888821262Z","maintainers":[{"display":"Liisi_Kerik","uri":"/user/Liisi_Kerik"}],"name":{"display":"Aoide","uri":"/package/Aoide"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"composition","uri":"/packages/tag/composition"},{"display":"library","uri":"/packages/tag/library"},{"display":"music","uri":"/packages/tag/music"}],"votes":0},{"description":"Library for Apple Push Notification Service","downloads":6,"lastUpload":"2009-07-13T19:38:44Z","maintainers":[{"display":"ChrisMoos","uri":"/user/ChrisMoos"}],"name":{"display":"ApplePush","uri":"/package/ApplePush"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"library","uri":"/packages/tag/library"},{"display":"network","uri":"/packages/tag/network"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Call AppleScript from Haskell, and then call back into Haskell.","downloads":20,"lastUpload":"2012-02-15T11:12:39Z","maintainers":[{"display":"ReinerPope","uri":"/user/ReinerPope"},{"display":"WouterSwierstra","uri":"/user/WouterSwierstra"}],"name":{"display":"AppleScript","uri":"/package/AppleScript"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"foreign","uri":"/packages/tag/foreign"}],"votes":0},{"description":"Function approximation","downloads":2,"lastUpload":"2015-04-26T10:09:29.167094Z","maintainers":[{"display":"DominicSteinitz","uri":"/user/DominicSteinitz"}],"name":{"display":"ApproxFun-hs","uri":"/package/ApproxFun-hs"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"library","uri":"/packages/tag/library"},{"display":"math","uri":"/packages/tag/math"}],"votes":0},{"description":"Unboxed references, dynamic arrays and more","downloads":22,"lastUpload":"2009-06-26T19:04:43Z","maintainers":[{"display":"GwernBranwen","uri":"/user/GwernBranwen"}],"name":{"display":"ArrayRef","uri":"/package/ArrayRef"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"data","uri":"/packages/tag/data"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"A library to generate Netlist code from Arrow descriptions.","downloads":3,"lastUpload":"2015-02-21T13:23:05.402924Z","maintainers":[{"display":"frosch03","uri":"/user/frosch03"},{"display":"brettschneider","uri":"/user/brettschneider"}],"name":{"display":"ArrowVHDL","uri":"/package/ArrowVHDL"},"tags":[{"display":"library","uri":"/packages/tag/library"},{"display":"public-domain","uri":"/packages/tag/public-domain"},{"display":"testing","uri":"/packages/tag/testing"}],"votes":0},{"description":"Strongly typed Attribute Grammars implemented using type-level programming.","downloads":52,"lastUpload":"2022-05-26T18:50:24.876992743Z","maintainers":[{"display":"MarcosViera","uri":"/user/MarcosViera"},{"display":"jpgarcia","uri":"/user/jpgarcia"}],"name":{"display":"AspectAG","uri":"/package/AspectAG"},"tags":[{"display":"aspect-oriented-programming","uri":"/packages/tag/aspect-oriented-programming"},{"display":"development-","uri":"/packages/tag/development-"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"language","uri":"/packages/tag/language"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Fast Bencode encoding and parsing library","downloads":14,"lastUpload":"2014-06-24T23:33:17.506075Z","maintainers":[{"display":"FlorianHartwig","uri":"/user/FlorianHartwig"}],"name":{"display":"AttoBencode","uri":"/package/AttoBencode"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"data","uri":"/packages/tag/data"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Simple lightweight JSON parser, generator & manipulator based on ByteString","downloads":22,"lastUpload":"2011-02-03T05:13:20Z","maintainers":[{"display":"HiromiIshii","uri":"/user/HiromiIshii"}],"name":{"display":"AttoJson","uri":"/package/AttoJson"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"deprecated","uri":"/packages/tag/deprecated"},{"display":"library","uri":"/packages/tag/library"},{"display":"text","uri":"/packages/tag/text"}],"votes":0},{"description":"Visualisation of Strange Attractors in 3-Dimensions","downloads":11,"lastUpload":"2010-03-15T10:01:26Z","maintainers":[{"display":"RubenZilibowitz","uri":"/user/RubenZilibowitz"}],"name":{"display":"Attrac","uri":"/package/Attrac"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"graphics","uri":"/packages/tag/graphics"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Yet another parser generator for C/C++","downloads":2,"lastUpload":"2011-11-08T06:36:20Z","maintainers":[{"display":"XinyuJiang","uri":"/user/XinyuJiang"}],"name":{"display":"Aurochs","uri":"/package/Aurochs"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"development","uri":"/packages/tag/development"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"GUI library based upon generic programming (SYB3)","downloads":9,"lastUpload":"2008-09-17T10:58:40Z","maintainers":[{"display":"MadsLindstroem","uri":"/user/MadsLindstroem"}],"name":{"display":"AutoForms","uri":"/package/AutoForms"},"tags":[{"display":"gui","uri":"/packages/tag/gui"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Balanced binary trees using the AVL algorithm.","downloads":18,"lastUpload":"2008-08-29T05:59:00Z","maintainers":[{"display":"AdrianHey","uri":"/user/AdrianHey"}],"name":{"display":"AvlTree","uri":"/package/AvlTree"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"data-structures","uri":"/packages/tag/data-structures"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Embedded BASIC","downloads":23,"lastUpload":"2009-02-09T09:36:35Z","maintainers":[{"display":"LennartAugustsson","uri":"/user/LennartAugustsson"}],"name":{"display":"BASIC","uri":"/package/BASIC"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"language","uri":"/packages/tag/language"},{"display":"library","uri":"/packages/tag/library"}],"votes":2},{"description":"Big Contact Map Tools","downloads":7,"lastUpload":"2015-05-05T17:37:55.917192Z","maintainers":[{"display":"kaizhang","uri":"/user/kaizhang"}],"name":{"display":"BCMtools","uri":"/package/BCMtools"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"library","uri":"/packages/tag/library"},{"display":"mit","uri":"/packages/tag/mit"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"A compiler front-end generator.","downloads":93,"lastUpload":"2022-02-17T17:38:38.309476485Z","maintainers":[{"display":"AndreasAbel","uri":"/user/AndreasAbel"},{"display":"GregoireDetrez","uri":"/user/GregoireDetrez"},{"display":"MarkusForsberg","uri":"/user/MarkusForsberg"},{"display":"ThomasHallgren","uri":"/user/ThomasHallgren"}],"name":{"display":"BNFC","uri":"/package/BNFC"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"library","uri":"/packages/tag/library"},{"display":"parsing","uri":"/packages/tag/parsing"},{"display":"program","uri":"/packages/tag/program"}],"votes":2.25},{"description":"Deriving Parsers and Quasi-Quoters from BNF Grammars","downloads":51,"lastUpload":"2020-02-09T23:44:05.066878431Z","maintainers":[{"display":"JeanPhilippeBernardy","uri":"/user/JeanPhilippeBernardy"},{"display":"JonasDuregard","uri":"/user/JonasDuregard"},{"display":"ArtemPelenitsyn","uri":"/user/ArtemPelenitsyn"}],"name":{"display":"BNFC-meta","uri":"/package/BNFC-meta"},"tags":[{"display":"development","uri":"/packages/tag/development"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"language","uri":"/packages/tag/language"},{"display":"library","uri":"/packages/tag/library"},{"display":"parsing","uri":"/packages/tag/parsing"},{"display":"text","uri":"/packages/tag/text"}],"votes":0},{"description":"Translations of classic Truth Maintenance Systems","downloads":3,"lastUpload":"2022-04-22T00:24:50.851029935Z","maintainers":[{"display":"jpmrst","uri":"/user/jpmrst"}],"name":{"display":"BPS","uri":"/package/BPS"},"tags":[{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"},{"display":"program","uri":"/packages/tag/program"},{"display":"truth-maintenance","uri":"/packages/tag/truth-maintenance"}],"votes":0},{"description":"Tools for self-assembly","downloads":2,"lastUpload":"2014-06-12T19:26:55.982603Z","maintainers":[{"display":"pmeunier","uri":"/user/pmeunier"}],"name":{"display":"Baggins","uri":"/package/Baggins"},"tags":[{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"},{"display":"math","uri":"/packages/tag/math"}],"votes":0},{"description":"A Drum Machine DSL for Haskell","downloads":17,"lastUpload":"2015-10-26T16:12:59.52351Z","maintainers":[{"display":"5outh","uri":"/user/5outh"}],"name":{"display":"Bang","uri":"/package/Bang"},"tags":[{"display":"library","uri":"/packages/tag/library"},{"display":"mit","uri":"/packages/tag/mit"},{"display":"sound","uri":"/packages/tag/sound"}],"votes":0},{"description":"An ad-hoc P2P chat program","downloads":8,"lastUpload":"2008-04-05T02:14:35Z","maintainers":[{"display":"GwernBranwen","uri":"/user/GwernBranwen"}],"name":{"display":"Barracuda","uri":"/package/Barracuda"},"tags":[{"display":"library","uri":"/packages/tag/library"},{"display":"network","uri":"/packages/tag/network"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"An interpreter for the Befunge-93 Programming Language","downloads":3,"lastUpload":"2010-05-20T18:25:24Z","maintainers":[{"display":"BrandonSimmons","uri":"/user/BrandonSimmons"}],"name":{"display":"Befunge93","uri":"/package/Befunge93"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"compilers-interpreters","uri":"/packages/tag/compilers-interpreters"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Benchmark functions with history","downloads":5,"lastUpload":"2015-11-19T14:22:31.9303Z","maintainers":[{"display":"ChristianHoener","uri":"/user/ChristianHoener"}],"name":{"display":"BenchmarkHistory","uri":"/package/BenchmarkHistory"},"tags":[{"display":"benchmarking","uri":"/packages/tag/benchmarking"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Berkeley DB binding","downloads":30,"lastUpload":"2013-03-13T19:54:56Z","maintainers":[{"display":"JohnMcCall","uri":"/user/JohnMcCall"},{"display":"StephenBlackheath","uri":"/user/StephenBlackheath"}],"name":{"display":"BerkeleyDB","uri":"/package/BerkeleyDB"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"database","uri":"/packages/tag/database"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Berkeley DB XML binding","downloads":25,"lastUpload":"2011-09-06T20:51:27Z","maintainers":[{"display":"StephenBlackheath","uri":"/user/StephenBlackheath"}],"name":{"display":"BerkeleyDBXML","uri":"/package/BerkeleyDBXML"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"database","uri":"/packages/tag/database"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Factorization of polynomials over finite field","downloads":2,"lastUpload":"2013-06-10T11:40:22Z","maintainers":[{"display":"AbdelwahebMiled","uri":"/user/AbdelwahebMiled"}],"name":{"display":"BerlekampAlgorithm","uri":"/package/BerlekampAlgorithm"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"library","uri":"/packages/tag/library"},{"display":"math","uri":"/packages/tag/math"}],"votes":0},{"description":"The Bidirectional Generic Update Language","downloads":11,"lastUpload":"2016-08-30T09:49:01.746971Z","maintainers":[{"display":"joshko","uri":"/user/joshko"},{"display":"Zirun","uri":"/user/Zirun"}],"name":{"display":"BiGUL","uri":"/package/BiGUL"},"tags":[{"display":"generics","uri":"/packages/tag/generics"},{"display":"language","uri":"/packages/tag/language"},{"display":"lenses","uri":"/packages/tag/lenses"},{"display":"library","uri":"/packages/tag/library"},{"display":"public-domain","uri":"/packages/tag/public-domain"}],"votes":2.25},{"description":"Image editor for pixel art","downloads":10,"lastUpload":"2014-01-24T03:18:08.778401Z","maintainers":[{"display":"ManuelChakravarty","uri":"/user/ManuelChakravarty"}],"name":{"display":"BigPixel","uri":"/package/BigPixel"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"development","uri":"/packages/tag/development"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Source-to-source plugin for enhancing EDSLs with static annotations","downloads":5,"lastUpload":"2020-03-19T17:59:05.904872539Z","maintainers":[{"display":"agustinmista","uri":"/user/agustinmista"}],"name":{"display":"BinderAnn","uri":"/package/BinderAnn"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"compiler-plugin","uri":"/packages/tag/compiler-plugin"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Common bin-packing heuristics.","downloads":14,"lastUpload":"2014-02-07T13:32:35.055121Z","maintainers":[{"display":"BjoernBrandenburg","uri":"/user/BjoernBrandenburg"},{"display":"DavidFeng","uri":"/user/DavidFeng"}],"name":{"display":"Binpack","uri":"/package/Binpack"},"tags":[{"display":"algorithms","uri":"/packages/tag/algorithms"},{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"heuristics","uri":"/packages/tag/heuristics"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Libary for Hidden Markov Models in HMMER3 format. ","downloads":46,"lastUpload":"2017-06-09T15:26:05.435990496Z","maintainers":[{"display":"FlorianEggenhofer","uri":"/user/FlorianEggenhofer"}],"name":{"display":"BioHMM","uri":"/package/BioHMM"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Base library for bioinformatics","downloads":12,"lastUpload":"2011-04-08T12:46:37Z","maintainers":[{"display":"ChristianHoener","uri":"/user/ChristianHoener"}],"name":{"display":"Biobase","uri":"/package/Biobase"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"BLAST-related tools","downloads":16,"lastUpload":"2021-06-05T21:06:10.915506997Z","maintainers":[{"display":"ChristianHoener","uri":"/user/ChristianHoener"},{"display":"FlorianEggenhofer","uri":"/user/FlorianEggenhofer"}],"name":{"display":"BiobaseBlast","uri":"/package/BiobaseBlast"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Vienna / DotBracket / ExtSS parsers","downloads":3,"lastUpload":"2011-08-22T15:27:13Z","maintainers":[{"display":"ChristianHoener","uri":"/user/ChristianHoener"}],"name":{"display":"BiobaseDotP","uri":"/package/BiobaseDotP"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"European Nucleotide Archive data","downloads":7,"lastUpload":"2021-06-04T12:37:25.444518495Z","maintainers":[{"display":"ChristianHoener","uri":"/user/ChristianHoener"}],"name":{"display":"BiobaseENA","uri":"/package/BiobaseENA"},"tags":[{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"data","uri":"/packages/tag/data"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Ensembl related datastructures and functions","downloads":8,"lastUpload":"2020-01-09T19:39:11.497450015Z","maintainers":[{"display":"FlorianEggenhofer","uri":"/user/FlorianEggenhofer"}],"name":{"display":"BiobaseEnsembl","uri":"/package/BiobaseEnsembl"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"Importer for FR3D resources","downloads":10,"lastUpload":"2012-02-16T14:20:59Z","maintainers":[{"display":"ChristianHoener","uri":"/user/ChristianHoener"}],"name":{"display":"BiobaseFR3D","uri":"/package/BiobaseFR3D"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"}],"votes":0},{"description":"streaming FASTA parser","downloads":16,"lastUpload":"2021-06-04T13:59:41.393107101Z","maintainers":[{"display":"ChristianHoener","uri":"/user/ChristianHoener"}],"name":{"display":"BiobaseFasta","uri":"/package/BiobaseFasta"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"bsd3","uri":"/packages/tag/bsd3"},{"display":"library","uri":"/packages/tag/library"},{"display":"program","uri":"/packages/tag/program"}],"votes":0},{"description":"Libary to interface with the Bioinformatics HTTP services - Entrez Ensembl","downloads":4,"lastUpload":"2019-11-20T21:19:53.584971279Z","maintainers":[{"display":"FlorianEggenhofer","uri":"/user/FlorianEggenhofer"}],"name":{"display":"BiobaseHTTP","uri":"/package/BiobaseHTTP"},"tags":[{"display":"bioinformatics","uri":"/packages/tag/bioinformatics"},{"display":"gpl","uri":"/packages/tag/gpl"},{"display":"library","uri":"/packages/tag/library"}],"votes":0}]}
About · Developer information · Legal