MINKOWSKI SUM SELECTION AND FINDING (Q3089093)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	MINKOWSKI SUM SELECTION AND FINDING	scientific article

Statements

scholarly article

0 references

MINKOWSKI SUM SELECTION AND FINDING (English)

0 references

0 references

0 references

0 references

0 references

International Journal of Computational Geometry & Applications

0 references

publication date

23 August 2011

0 references

zbMATH Keywords

bioinformatics

0 references

sequence analysis

0 references

Minkowski sum

0 references

MaRDI profile type

MaRDI publication profile

0 references

Efficient algorithms for \(k\) maximum sums

0 references

Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint

0 references

An Optimal-Time Algorithm for Slope Selection

0 references

0 references

A RANDOMIZED ALGORITHM FOR SLOPE SELECTION

0 references

Generalized Selection and Ranking: Sorted Matrices

0 references

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications

0 references

Fast algorithms for the density finding problem

0 references

Randomized algorithm for the sum selection problem

0 references

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.

0 references

Randomized optimal algorithm for slope selection

0 references

Efficient randomized algorithms for the repeated median line estimator

0 references

Identifiers

zbMATH Open document ID

0 references

10.1142/S0218195911003664

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3089093

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3089093&oldid=35243599"