[图书][B] Combinatorics of genome rearrangements

G Fertin - 2009 - books.google.com
A comprehensive survey of a rapidly expanding field of combinatorial optimization,
mathematically oriented but offering biological explanations when required. From one cell to …

Sorting by transpositions is difficult

L Bulteau, G Fertin, I Rusu - SIAM Journal on Discrete Mathematics, 2012 - SIAM
In comparative genomics, a transposition is an operation that exchanges two consecutive
sequences of genes in a genome. The transposition distance between two genomes, that is …

Analytical router modeling for networks-on-chip performance analysis

UY Ogras, R Marculescu - 2007 Design, Automation & Test in …, 2007 - ieeexplore.ieee.org
Networks-on-chip (NoCs) have recently emerged as a scalable alternative to classical bus
and point-to-point architectures. To date, performance evaluation of NoC designs is largely …

The k-mismatch problem revisited

R Clifford, A Fontaine, E Porat, B Sach… - Proceedings of the twenty …, 2016 - SIAM
We revisit the complexity of one of the most basic problems in pattern matching. In the k-
mismatch problem we must compute the Hamming distance between a pattern of length m …

Concept extraction from student essays, towards concept map mining

J Villalon, RA Calvo - 2009 Ninth IEEE International …, 2009 - ieeexplore.ieee.org
This paper presents a new approach for automatic concept extraction, using grammatical
parsers and Latent Semantic Analysis. The methodology is described, also the tool used to …

Sharp tractability borderlines for finding connected motifs in vertex-colored graphs

MR Fellows, G Fertin, D Hermelin, S Vialette - Automata, Languages and …, 2007 - Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a
motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices …

A simple algorithm for approximating the text-to-pattern hamming distance

T Kopelowitz, E Porat - 1st Symposium on Simplicity in Algorithms …, 2018 - drops.dagstuhl.de
The algorithmic task of computing the Hamming distance between a given pattern of length
m and each location in a text of length n, both over a general alphabet\Sigma, is one of the …

Average parameterization and partial kernelization for computing medians

N Betzler, J Guo, C Komusiewicz… - Journal of Computer and …, 2011 - Elsevier
We propose an effective polynomial-time preprocessing strategy for intractable median
problems. Developing a new methodological framework, we show that if the input objects of …

Approximate Hamming distance in a stream

R Clifford, T Starikovskaya - arXiv preprint arXiv:1602.07241, 2016 - arxiv.org
We consider the problem of computing a $(1+\epsilon) $-approximation of the Hamming
distance between a pattern of length $ n $ and successive substrings of a stream. We first …

A deep neural network model for Chinese toponym matching with geographic pre-training model

Q Qiu, S Zheng, M Tian, J Li, K Ma… - International Journal of …, 2024 - Taylor & Francis
Multiple tasks within the field of geographical information retrieval and geographical
information sciences necessitate toponym matching, which involves the challenge of …