Jump to:
loading...| Preferred Name |
Genome indexing (Burrows-Wheeler) |
|
| Synonyms |
|
|
| Definitions |
The Burrows-Wheeler Transform (BWT) is a permutation of the genome based on a suffix array algorithm. Generate an index of a genome sequence using the Burrows-Wheeler algorithm. |
|
| ID |
http://edamontology.org/operation_3212 |
|
| Obsolete |
true |
|
| comment |
The Burrows-Wheeler Transform (BWT) is a permutation of the genome based on a suffix array algorithm. |
|
| Created in |
1.1 |
|
| deprecated |
true |
|
| hasDefinition |
Generate an index of a genome sequence using the Burrows-Wheeler algorithm. |
|
| inSubset | ||
| label |
Genome indexing (Burrows-Wheeler) |
|
| Obsolete since |
1.12 |
|
| Old parent | ||
| prefixIRI |
operation_3212 |
|
| prefLabel |
Genome indexing (Burrows-Wheeler) |
|
| replacedBy | ||
| subClassOf |