Search Results for "k-meleon" - Page 3
Sort By:
Showing 71 open source projects for "k-meleon"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
mitoMaker
mitoMaker - a mitochondria assembly and annotation script
...mitoMaker calls well known assemblers and algorithms, such as SOAPdenovo, MIRA and blast+ and parses their results providing easily readable outputs, such as FASTA, GENBANK, SEQUIN, PNG and others. General pipeline: 1-iterative De Novo assembly, with different k-mer values, trying to assemble a build that matches a target mitochondrial genome given. 2-searches for all mitochondrial gene features and circularization. 3-stores the best result found. 4-uses the best assembly as backbone for a reference based assembly, using MIRA and MITObim, trying to extend the mitogenome and close gaps. 5-annotates the best assembly, identifying the start and end position of each and every feature. 6-creates a folder with all the results (PNG, GENBANK, FASTA, SEQUIN, CAF, MAF and a stats logfile). -
2
Islaki Defender
Missile Command-type game for Linux using Pygame
IMPORTANT: The cursor is used to aim, the primary firing buttions are 'J', 'K', and 'L'. There is no startup menu as of yet so the game just jumps right in. Islaki defender is a program I wrote a few years ago for python 2.7. I have tried updating for Python3, however pygame does not appear to be compatible just yet. This game is similar to Missile Command however it adds an extra dimension of variability. -
3
UnsupervisedPy
unsupervised learning algorithms for python
This is a library for python containing popular machine learning algorithms under the unsupervised learning framework. Algorithms implemented up to now: K-Means Intelligent K-Means Weighted K-Means Minkowski Weighted K-Means Intelligent Minkowski Weighted K-Means Partition Around Medoids (PAM) Build (initialization for PAM) Minkowski Weighted PAM (with and without Build) Ward Method -
4
mitoMaker
mitoMaker - a mitochondria pipeline wrapper script
...After various attempts to build different mitochondrial genomes in the lab I studied, a general pipeline started to appear: assemble reads with MIRA or SOAPdenovo-Trans, look for a scaffold/contig that matches a closely-related species, check it to see if all expected genomic features are present (since mitochondria is well conserved), check to see if the assembly might have circularized (since it's a circular DNA). If a feature was missing, or it hasn't circularized, try and assemble again with different assembler parameters (mainly k-mer). Rinse and repeat until the best build is found. -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
5
Rogue
An adventure "Legend of Zelda"-ish game
For now, a simple python/pygame game that is needing of heavy development. I am working alone (so far) on this project, so it will be very slow. Please be patient, for this is not what the game will be like in the end. This is just me giving a sneak peak at something much nicer to come. And as I said before, I am so far alone and a bit of a novice in this project, so please be patient: I hope to make better things with it. Update: I have a new homepage up. Mostly complete right now, I... -
6
prcs2hg
Command to convert a PRCS project to Mercurial revisions
...It would help you publish the revision history of an obsolete project whose changes were maintained with PRCS. prcs2hg requires a working prcs command to extract versions from a PRCS repository and this project also provides the restored 'k' versions of PRCS for use with prcs2hg. The source code repository is separately hosted on Bitbucket with a public issue tracker. -
7
MSTParser
MSTParser is a non-projective dependency parser that searches for maxi
MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported. mstparser 0.5.1 is now available via Maven Central. If you use Maven as your build tool, then you can add it as a dependency in your pom.xml file: <dependency> <groupId>net.sourceforge.mstparser</groupId> <artifactId>mstparser</artifactId> ... -
8
-
9
Gnuplot2TightPDF
Python script that produces a tight pdf from gnuplot with psfrag text.
...Shibaji Banerjee Department of Physics St. Xavier's College, Kolkata Included: Main file: gpt2pdf.py demo file: demo.plt demo file; K.plt and K.txt Usage: gpt2pdf demo gpt2pdf K The script is written in pure python. It is easy enough for customization. -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
SuperX
An Operating System based on the K Desktop Environment.
SuperX is a desktop-oriented computer operating system based on Ubuntu and Debian GNU/Linux, using the KDE desktop environment. It was originally developed in India by a teenager, Wrix who built it using free and open-source software. SuperX is highly modular, flexible and cloud-centric, with a desktop user interface especially designed with Linux beginners in mind. -
11
Golden Point
A simple, console-based card game, similar to some other card games.
...The main goal of the game is to get more points then your opponent, but in the same time not to get more than 21 ("Golden Point"). During the game you get cards, which have next values: 6, 7, 8, 9, 10 - according to numbers in it's names; J - 2 points; Q - 3 points; K - 4 points; A - 11 points. In the beginning of the game you get 2 cards, and if your total points are less than 21, you can take more cards or keep your current cards. Then is your opponent's turn. If player got 21 - this is called "Golden Point". If player got more than 21 - this is too much, he has lost. So if Player 1 has too much, and Player 2 isn't - Player 2 wins. ... -
12
Pronac MediaMonkey Extension
Recommends music based upon your current taste.
...Play the first song from the Now Playing list, it'll recommend you next songs from the same list. NOTE: MAKE SURE THAT SONG SHUFFLE IS TURNED OFF WHILE USING PRONAC. Based upon K-Nearest Neighbor Machine Learning Algorithm, K-Fold Cross Validation and EchoNest for audio features. -
13
-
14
A lightweight program to edit and display rhythms for K-12 classroom use. For now, this program depends on the rhythms font from http://www.hindson.com.au/wordpress/free-fonts-available-for-download/ Fix needed! Will come soon (windows shortcuts)
-
15
A Battlefield Bad company 2 Servertool enabling: - Serverlog - Longtime Stats - Monitoring Killing Sprees - PunkBuster Log
-
16
Pynk, or the Python Network (K/C)ontrol (Names are hard, give me a break) is a programme designed to return data, when polled, about the system it is sitting upon. We Don't Need No Stinking SSH
-
17
A simple graphical file explorer which lists recursively files or directory K-File is usefull to quickly identify the biggest files that consume space on your hard drive or on your USB stick.
-
18
KUNWiki stands for K UNiversal Wiki. It is an extended version of MediaWiki integrated with Web 2.0/3.0 features to provided one stop solution that provides Ease of Use, Community Features & Data aggregation capabilities.
-
19
AKIRA aims to create a C++ development framework to build cognitive architectures and complex artificial intelligent agents.Features:KQML,Fuzzy Logic,Neural Net,Fuzzy Cognitive Maps and DIPRA (a distributed BDI - Belief Desire Intention goals model)
-
20
Active Spam Killer (ASK) protects your email account against spam by confirming the sender's email address before actual delivery takes place. The confirmation happens by means of a "confirmation message" that is automatically sent to all "unknown" users
-
21
clusterviz allows to cluster three-dimensional data. The clustering process is visualized using OpenGL. As clustering algorithms the family of k-means algorithms is implemented, including mixture models.
