Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

A Simple Linear Space Algorithm for Computing Nonoverlapping Inversion and Transposition Distance in Quadratic Average Time.

Journal of computational biology : a journal of computational molecular cell biology - 1 Jun 2018

Wang Xiaodong, Wang Lei

Abstract excerpt

In the sequence alignment problem, it is important to compare DNA sequences to retrieve relevant information and align these sequences. An inversion and a translocation are important operations in comparing DNA sequences in biosequence analysis. The alignment problem with nonoverlapping inversions and translocations is to find an alignment with nonoverlapping inversions and translocations for the given two...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Computational Biology

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Mutation

Share to Sequence Alignment

Share to Sequence Analysis, DNA

Source

Identifiers

PMID: 29658774
DOI: 10.1089/cmb.2017.0257

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

A Simple Linear Space Algorithm for Computing Nonoverlapping Inversion and Transposition Distance in Quadratic Average Time.PMID 29658774Read ↗

Rearrangement distance with reversals, indels, and moves in intergenic regions on signed and unsigned permutations.Semantic proximity Read ↗

Reversals and transpositions distance with proportion restriction.Semantic proximity Read ↗

A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.Semantic proximity Read ↗

The mutated subsequence problem and locating conserved genes.Semantic proximity Read ↗

Sorting permutations by fragmentation-weighted operations.Semantic proximity Read ↗

A graph-theoretical approach to DNA similarity analysisSemantic proximity Read ↗

A general heuristic for genome rearrangement problems.Semantic proximity Read ↗

Neweyes: a system for comparing biological sequences using the running Karp-Rabin Greedy String-Tiling algorithm.Semantic proximity Read ↗

The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform.Semantic proximity Read ↗

Super oriented cycles in permutations.Semantic proximity Read ↗

Application of consensus string matching in the diagnosis of allelic heterogeneity involving transposition mutation.Semantic proximity Read ↗

Sorting by restricted-length-weighted reversals.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.