Skip to content

About

Assignment for Data Structures and Algorithms for Scientists. Find an optimal set of non-overlapping genes from a text file of genes. Each line representing gene i in the text file should be: si ei ri where si is the start position of the gene, ei is the end position of the gene, and ri is the score of the gene.

Resources

Stars

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

3 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 

Repository files navigation

EditDistanceForGenes

Assignment for Data Structures and Algorithms for Scientists. Find an optimal set of non-overlapping genes from a text file of genes. Each line representing gene i in the text file should be: si ei ri where si is the start position of the gene, ei is the end position of the gene, and ri is the score of the gene.

All rights reserved by Amey Ghadigaonkar.

About

Assignment for Data Structures and Algorithms for Scientists. Find an optimal set of non-overlapping genes from a text file of genes. Each line representing gene i in the text file should be: si ei ri where si is the start position of the gene, ei is the end position of the gene, and ri is the score of the gene.

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages