pairs

Minor mode for Emacs that deals with parens pairs and tries to be smart about it.

Basic auto pairs extension of coc.nvim

1D/2D indexing and querying on bgzipped text file with a pair of genomic coordinates

Pair Trading View - .NET application for visual analysis of synthetic financial instruments based on statistical models.

An easy-to-use Hi-C data processing software supporting distributed computation.

Object-oriented Java tuples

⌨️ Convenient padding and closing of brackets for Atom

R binder for pairix - 2D/1D genomic indexing and querying on bgzipped text file

Memory Game / Jogo da Memória

Automatically add closing pairs when typing in Bash's prompt

This repo aims to curate path for learning C++ STL starting from basics.

Allows to put arrays into sets. Works similarly like ES6 Sets.

「Raw pairs to SQLite prototype converter」

Allows to put arrays into maps. Works similarly like ES6 Maps.

R Project based on the paper “How some bankers made a million by trading just two securities?” by Kalle Rinne and Matti Suominen.

Zigzag Expanded Navigation Plots -- Visualizing high-dimensional data by laying out a path of alternating 1d and 2d views

Create an object from key-value pairs.

Example quantitative research

Here i will uploaded all the functions related to the Standard Template Library ( STL ) in C++

Hadoop Map Reduce project

Welcome. Take a look at Simon Freund’s work by playing a round of Pairs. Select a deck, the amount of cards and start playing. Choose the duel mode to play with a friend.

A simplified memory game in python with Kivy.

🏄 get blocks of balanced pairs, eg: {}, <a></a> or code fences ```

This classic favorite with adorable animals. Match pairs, triplets and even quartets! (Vue.js + Vuetify) 🐘🐘🦜🦜 This game was made for my 5 & 3 y/o cousins, and they liked it! Also, this project helped me to improve my Vue.js skills.

In this assignment, we will look at an application of Dynamic Programming to align DNA sequences. In the global DNA sequence alignment problem, you are given as input two DNA sequences S1, S2, which are strings using the four characters A, C, T, G. The strings are of lengths m, n, where possibly m not equal n. Given two DNA sequences, the goal is to compute the best possible (minimum) alignment cost between them. We will soon specify how to compute the alignment cost between two sequences.

Binance pairs

🍟 Convert between object and array pairs.

Memory, the Card Game.

Return an array of an object's own enumerable property key-value pairs.