{"id":24021077,"url":"https://github.com/zipcodecore/hammingitupjava","last_synced_at":"2025-04-15T21:15:21.203Z","repository":{"id":45457190,"uuid":"220031116","full_name":"ZipCodeCore/HammingItUpJava","owner":"ZipCodeCore","description":"compute hamming distance between two DNA strings.","archived":false,"fork":false,"pushed_at":"2023-10-17T20:07:26.000Z","size":14,"stargazers_count":1,"open_issues_count":13,"forks_count":56,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-15T21:15:16.032Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ZipCodeCore.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2019-11-06T15:39:07.000Z","updated_at":"2024-02-25T07:50:07.000Z","dependencies_parsed_at":"2022-07-14T13:01:12.063Z","dependency_job_id":"53d763b8-527b-4dfa-8003-b22101553fe1","html_url":"https://github.com/ZipCodeCore/HammingItUpJava","commit_stats":null,"previous_names":[],"tags_count":0,"template":true,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FHammingItUpJava","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FHammingItUpJava/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FHammingItUpJava/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FHammingItUpJava/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ZipCodeCore","download_url":"https://codeload.github.com/ZipCodeCore/HammingItUpJava/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":249153949,"owners_count":21221330,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-01-08T12:38:31.559Z","updated_at":"2025-04-15T21:15:21.182Z","avatar_url":"https://github.com/ZipCodeCore.png","language":"Java","readme":"# HammingItUpJava (Hamming)\nFork this repository and submit the URL of your fork via the Student Portal.\n\n\nCalculate the *Hamming difference* between two DNA strands.\n\nA mutation is simply a mistake that occurs during the creation or\ncopying of a nucleic acid, in particular DNA. Because nucleic acids are\nvital to cellular functions, mutations tend to cause a ripple effect\nthroughout the cell. Although mutations are technically mistakes, a very\nrare mutation may equip the cell with a beneficial attribute. In fact,\nthe macro effects of evolution are attributable by the accumulated\nresult of beneficial microscopic mutations over many generations.\n\nThe simplest and most common type of nucleic acid mutation is a point\nmutation, which replaces one base with another at a single nucleotide.\n\nBy counting the number of differences between two homologous DNA strands\ntaken from different genomes with a common ancestor, we get a measure of\nthe minimum number of point mutations that could have occurred on the\nevolutionary path between the two strands.\n\nThis is called the 'Hamming distance'.\n\nIt is found by comparing two DNA strands and counting how many of the\nnucleotides are different from their equivalent in the other string.\n\n    GAGCCTACTAACGGGAT\n    CATCGTAATGACGGCCT\n    ^ ^ ^  ^ ^    ^^\n\nThe Hamming distance between these two DNA strands is 7.\n\n# Implementation notes\n\nThe Hamming distance is only defined for sequences of equal length. This means\nthat based on the definition, each language could deal with getting sequences\nof equal length differently.\n\n# Java Tips\n\n## Hints\n\nThis is an exercise with tests that require you to throw an\n[`Exception`](https://docs.oracle.com/javase/8/docs/api/java/lang/Exception.html). `Exception`s are typically thrown to\nindicate that a program has encountered an unexpected input or state.\n\nWe use JUnit's [`ExpectedException`](http://junit.org/junit4/javadoc/4.12/org/junit/rules/ExpectedException.html)\n[rule](https://github.com/junit-team/junit4/wiki/rules) throughout the track to verify that the exceptions you throw\nare:\n\n1. instances of a specified Java type;\n2. (optionally) initialized with a specified message.\n\n\n# Running the tests\n\nYou must run all the tests and pass them all. Read the tests carefully.\nPlease NOTE the need for defining and throwing EXCEPTIONS.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzipcodecore%2Fhammingitupjava","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzipcodecore%2Fhammingitupjava","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzipcodecore%2Fhammingitupjava/lists"}